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
Linear-size circuits for stable $0,1 < 2$ sorting?
Regan
✭✭
1
Complexity
KWRegan
Exponential Algorithms for Knapsack
Lipton
✭✭
1
Algorithms
dick lipton
Sums of independent random variables with unbounded variance
Feige
✭✭
0
cwenner
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
Discrete Logarithm Problem
✭✭✭
0
Complexity
cplxphil
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)
Feige
✭✭✭
0
Complexity
»
Hardness of Approximation
cwenner
P vs. PSPACE
Folklore
✭✭✭
0
Complexity
cwenner
P vs. BPP
Folklore
✭✭✭
0
Complexity
»
Derandomization
Charles R Great...
P vs. NP
Cook
;
Levin
✭✭✭✭
0
Algorithms
zitterbewegung
One-way functions exist
✭✭✭✭
0
Complexity
porton
Navigate
Subject
Algebra
(7)
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
Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
more