Mathematics catalogue
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.
6,288 records · Search and filter
- Math-3001 One-sample matroid prophet selection
- Math-3002 Polynomial deterministic two-way simulation of one-way NFAs
- Math-3003 Two-fifths-power space simulation for one writable tape
- Math-3004 Deterministic quasipolynomial mean-payoff games
- Math-3005 Perfect-completeness two-to-one hardness
- Math-3006 Entropy bounds at perfect-matching marginals
- Math-3007 Cubic border-determinantal lower bound for the permanent
- Math-3008 Worst-case Subset Sum below the half exponent
- Math-3009 Average sensitivity of polynomial threshold functions
- Math-3010 Matrix hitting points in every positive characteristic
- Math-3011 Quasilinear robust PCP for PPAD
- Math-3012 Almost-linear maximum-cardinality matching
- Math-3013 Randomized k-server with squared-logarithmic ratio
- Math-3014 One rational matrix hitting point for noncommutative formulas
- Math-3015 Quadratic sensitivity versus block sensitivity
- Math-3016 Factor-two shortest common superstring
- Math-3017 Quasipolynomial stochastic mean-payoff decision
- Math-3018 Low-space worst-case Subset Sum at half-exponential time
- Math-3019 Independent-set hardness with a three-colorability promise
- Math-3020 Polynomial-time three-machine unit-job scheduling
- Math-3021 Polynomial state complementation of two-way NFAs
- Math-3022 Uniform finite-metric randomized k-server implementation
- Math-3023 Uniform quasipolynomial worst-case trace reconstruction
- Math-3024 Constant-factor hardness of uniform sparsest cut
- Math-3025 Large Goemans–Linial gaps for uniform sparsest cut
- Math-3026 EXPTIME-completeness of variable-dimensional WL
- Math-3027 Factor-two hardness of Vertex Cover
- Math-3028 Zero dimension exponent for well-conditioned sampling queries
- Math-3029 Complexity of Weisfeiler–Leman graph identification
- Math-3030 Parity witnesses for Weisfeiler–Leman equivalence
- Math-3031 Superpolynomial worst-case trace sample lower bounds
- Math-3032 Elementary expansion for Grothendieck infinity-groupoids
- Math-3033 Curtis stable mod-two Hurewicz image
- Math-3034 Filtered chromatic splitting at generic primes
- Math-3035 Hahn–Wilson thick generation at fp-type two
- Math-3036 Finite assembly of the height-three chromatic overlap
- Math-3037 Rational injectivity of maximal coarse assembly
- Math-3038 Pure cosmetic surgery for knots in the three-sphere
- Math-3039 Rational injectivity of reduced coarse assembly
- Math-3040 Singer vanishing in dimension four
- Math-3041 Thomason structures in all strict categorical dimensions
- Math-3042 Kervaire detection at the prime three
- Math-3043 Wall D(2) problem with a finite target model
- Math-3044 Continuum Hypothesis
- Math-3045 Are there infinitely many perfect powers in the Fibonacci sequence?
- Math-3046 The Moving Sofa Problem
- Math-3047 Singular Cardinals Hypothesis
- Math-3048 Whitehead Problem
- Math-3049 The Polynomial Hirsch Conjecture
- Math-3050 The Cycle Double Cover Conjecture