Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
»
Theoretical Comp. Sci.
Complexity
Title
Author(s)
Imp.¹
Rec.²
Subtopic
Posted by
Subset-sums equality (pigeonhole version)
✭✭✭
0
mdevos
Unconditional derandomization of Arthur-Merlin games
Shaltiel
;
Umans
✭✭✭
0
Derandomization
ormeir
Complexity of square-root sum
Goemans
✭✭
0
abie
Discrete Logarithm Problem
✭✭✭
0
cplxphil
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)
Feige
✭✭✭
0
Hardness of Approximation
cwenner
P vs. PSPACE
Folklore
✭✭✭
0
cwenner
P vs. BPP
Folklore
✭✭✭
0
Derandomization
Charles R Great...
One-way functions exist
✭✭✭✭
0
porton
Linear-size circuits for stable $0,1 < 2$ sorting?
Regan
✭✭
1
KWRegan
Navigate
Subject
Algebra
(295)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Algorithms
(2)
Coding Theory
(1)
Complexity
(9)
Derandomization
(2)
Hardness Amplification
(0)
Hardness of Approximation
(1)
Interactive Proofs
(0)
PCP
(0)
Cryptography
(0)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Nowhere-zero flows
Shuffle-Exchange Conjecture
Algebra
Seagull problem
Solution to the Lonely Runner Conjecture
more