Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
»
Theoretical Comp. Sci.
Complexity
Title
Author(s)
Imp.¹
Rec.²
Subtopic
Posted by
Complexity of square-root sum
Goemans
✭✭
0
abie
Discrete Logarithm Problem
✭✭✭
0
cplxphil
Linear-size circuits for stable $0,1 < 2$ sorting?
Regan
✭✭
1
KWRegan
One-way functions exist
✭✭✭✭
0
porton
P vs. BPP
Folklore
✭✭✭
0
Derandomization
Charles R Great...
P vs. PSPACE
Folklore
✭✭✭
0
cwenner
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)
Feige
✭✭✭
0
Hardness of Approximation
cwenner
Subset-sums equality (pigeonhole version)
✭✭✭
0
mdevos
Unconditional derandomization of Arthur-Merlin games
Shaltiel
;
Umans
✭✭✭
0
Derandomization
ormeir
Navigate
Subject
Algebra
(298)
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
Is Dragon Ball Legends Safe? Account Security Guide — Avoid Bans, Scams & Hacks (2026)
Dragon Ball Legends PvP Team Building Guide — Tags, Synergy & Win Conditions (2026)
Dragon Ball Legends Free Chrono Crystals — Legit Methods That Actually Work (2026)
Dragon Ball Legends Free Chrono Crystals — Legit Methods That Actually Work (2026)
Nowhere-zero flows
more