Top Open Problems
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
5,428 records · Search and filter
- Math-3051 Quasipolynomial mean-payoff/parity winning sets
- Math-3052 Metric k-median at factor one plus two over e
- Math-3053 Metric k-median strictly below factor two
- Math-3054 Constant-factor hardness of Min-UnCut
- Math-3055 Hitting lists for noncommutative rational formulas
- Math-3056 One-sample matroid prophet selection
- Math-3057 Polynomial deterministic two-way simulation of one-way NFAs
- Math-3058 Two-fifths-power space simulation for one writable tape
- Math-3059 Deterministic quasipolynomial mean-payoff games
- Math-3060 Perfect-completeness two-to-one hardness
- Math-3061 Entropy bounds at perfect-matching marginals
- Math-3062 Cubic border-determinantal lower bound for the permanent
- Math-3063 Worst-case Subset Sum below the half exponent
- Math-3064 Average sensitivity of polynomial threshold functions
- Math-3065 Matrix hitting points in every positive characteristic
- Math-3066 Quasilinear robust PCP for PPAD
- Math-3067 Almost-linear maximum-cardinality matching
- Math-3068 Randomized k-server with squared-logarithmic ratio
- Math-3069 One rational matrix hitting point for noncommutative formulas
- Math-3070 Quadratic sensitivity versus block sensitivity
- Math-3071 Factor-two shortest common superstring
- Math-3072 Quasipolynomial stochastic mean-payoff decision
- Math-3073 Low-space worst-case Subset Sum at half-exponential time
- Math-3074 Independent-set hardness with a three-colorability promise
- Math-3075 Polynomial-time three-machine unit-job scheduling
- Math-3076 Polynomial state complementation of two-way NFAs
- Math-3077 Uniform finite-metric randomized k-server implementation
- Math-3078 Uniform quasipolynomial worst-case trace reconstruction
- Math-3079 Constant-factor hardness of uniform sparsest cut
- Math-3080 Large Goemans–Linial gaps for uniform sparsest cut
- Math-3081 EXPTIME-completeness of variable-dimensional WL
- Math-3082 Factor-two hardness of Vertex Cover
- Math-3083 Zero dimension exponent for well-conditioned sampling queries
- Math-3084 Complexity of Weisfeiler–Leman graph identification
- Math-3085 Parity witnesses for Weisfeiler–Leman equivalence
- Math-3086 Superpolynomial worst-case trace sample lower bounds
- Math-3087 Elementary expansion for Grothendieck infinity-groupoids
- Math-3088 Curtis stable mod-two Hurewicz image
- Math-3089 Filtered chromatic splitting at generic primes
- Math-3090 Hahn–Wilson thick generation at fp-type two
- Math-3091 Finite assembly of the height-three chromatic overlap
- Math-3092 Rational injectivity of maximal coarse assembly
- Math-3093 Pure cosmetic surgery for knots in the three-sphere
- Math-3094 Rational injectivity of reduced coarse assembly
- Math-3095 Singer vanishing in dimension four
- Math-3096 Thomason structures in all strict categorical dimensions
- Math-3097 Kervaire detection at the prime three
- Math-3098 Wall D(2) problem with a finite target model
- Math-3099 Continuum Hypothesis
- Math-3100 Are there infinitely many perfect powers in the Fibonacci sequence?