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.
16,859 records · Search and filter
- Math-10351 Annular variation of the triangular Hilbert transform
- Math-10352 The symmetric maximal triangular Hilbert transform
- Math-10353 Balanced L3 boundedness of the trilinear Hilbert transform
- Math-10354 Polynomial switch-chain mixing for all degree sequences
- Math-10355 Matrix-multiplication improvement over every field
- Math-10356 Exact uniform sampling of arbitrary-margin contingency tables
- Math-10357 Bounded additive gap for the bin-packing configuration LP
- Math-10358 FPRAS for cell-bounded contingency tables
- Math-10359 FPRAS for common integer polymatroid bases
- Math-10360 FPRAS for common matroid bases
- Math-10361 Complex square and rectangular multiplication bounds
- Math-10362 Complex matrix multiplication at exponent nine-fourths
- Math-10363 Hellinger contraction with biased Boolean outputs
- Math-10364 Sharp binary-channel information contraction on the cube
- Math-10365 Constant-factor hardness of directed feedback vertex set
- Math-10366 Almost-linear edit-distance approximation scheme
- Math-10367 Counting-hierarchy upper bound for existential-universal real sentences
- Math-10368 Explicit super-square-root-exponential depth-three circuits
- Math-10369 Memory–precision lower bounds for exact Gaussian regression
- Math-10370 Unconditional time lower bounds for fixed-dimensional WL
- Math-10371 FPRAS for perfect matchings in general graphs
- Math-10372 Quasipolynomial trace samples for arbitrary symbols
- Math-10373 Depth-five homogeneous lower bounds for iterated matrix multiplication
- Math-10374 Integer multiplication below n log n
- Math-10375 Exponential semidefinite complexity for perfect matching
- Math-10376 Optimal Max-Cut approximation hardness
- Math-10377 Quasipolynomial mean-payoff/parity winning sets
- Math-10378 Metric k-median at factor one plus two over e
- Math-10379 Metric k-median strictly below factor two
- Math-10380 Constant-factor hardness of Min-UnCut
- Math-10381 Hitting lists for noncommutative rational formulas
- Math-10382 One-sample matroid prophet selection
- Math-10383 Polynomial deterministic two-way simulation of one-way NFAs
- Math-10384 Two-fifths-power space simulation for one writable tape
- Math-10385 Deterministic quasipolynomial mean-payoff games
- Math-10386 Perfect-completeness two-to-one hardness
- Math-10387 Entropy bounds at perfect-matching marginals
- Math-10388 Cubic border-determinantal lower bound for the permanent
- Math-10389 Worst-case Subset Sum below the half exponent
- Math-10390 Average sensitivity of polynomial threshold functions
- Math-10391 Matrix hitting points in every positive characteristic
- Math-10392 Quasilinear robust PCP for PPAD
- Math-10393 Almost-linear maximum-cardinality matching
- Math-10394 Randomized k-server with squared-logarithmic ratio
- Math-10395 One rational matrix hitting point for noncommutative formulas
- Math-10396 Quadratic sensitivity versus block sensitivity
- Math-10397 Factor-two shortest common superstring
- Math-10398 Quasipolynomial stochastic mean-payoff decision
- Math-10399 Low-space worst-case Subset Sum at half-exponential time
- Math-10400 Independent-set hardness with a three-colorability promise