Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Theoretical Computer Science
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Complexity of square-root sum
Goemans
✭✭
0
Complexity
abie
P vs. BPP
Folklore
✭✭✭
0
Complexity
»
Derandomization
Charles R Great...
Discrete Logarithm Problem
✭✭✭
0
Complexity
cplxphil
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)
Feige
✭✭✭
0
Complexity
»
Hardness of Approximation
cwenner
Sums of independent random variables with unbounded variance
Feige
✭✭
0
cwenner
P vs. PSPACE
Folklore
✭✭✭
0
Complexity
cwenner
Exponential Algorithms for Knapsack
Lipton
✭✭
1
Algorithms
dick lipton
Linear-size circuits for stable $0,1 < 2$ sorting?
Regan
✭✭
1
Complexity
KWRegan
Subset-sums equality (pigeonhole version)
✭✭✭
0
Complexity
mdevos
The robustness of the tensor product
Ben-Sasson
;
Sudan
✭✭✭
0
Coding Theory
ormeir
Unconditional derandomization of Arthur-Merlin games
Shaltiel
;
Umans
✭✭✭
0
Complexity
»
Derandomization
ormeir
One-way functions exist
✭✭✭✭
0
Complexity
porton
P vs. NP
Cook
;
Levin
✭✭✭✭
0
Algorithms
zitterbewegung
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)
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