HN Explorer

cevi

↗ HN profile [ 87.1 ms ] full profile
Karma
0
Created
()
Submissions
0
  1. Simon Claims Polynomial-Time Quantum Algorithm for Lattice Problems (postquantum.com)
    2 points 0
  2. Cookie Clicker Ultra (introduction to googology) (olsak.net)
    2 points 0
  3. Four Levels of Voting Methods (hiveism.substack.com)
    2 points 0
  4. Quantified CSPs are either PSPACE-complete or inside Pi_2 (arxiv.org)
    2 points 0
  5. Simplified proof of the Constraint Satisfaction Problem Dichotomy Conjecture (arxiv.org)
    1 points 1
  6. NP-hard SAT and CSP problems which admit exponentially improved algorithms (dl.acm.org)
    5 points 1