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-11951 Sample Complexity of Vertex-Distribution-Free Graph Testing
- Math-11952 Complexity of Approximate Counting in Spin Systems
- Math-11953 Exact Higher-Order Matrix Decomposability
- Math-11954 Semidefinite Hierarchies for Equiangular Line Bounds
- Math-11955 Computational Recognition of Polytope Face Vectors and Cones
- Math-11956 Recognition of Virtually Special Hyperbolic Three-Manifolds
- Math-11957 Minimum Crossing Realizations of Spatial Polygon Angle Sequences
- Math-11958 Submultiplicativity Gaps for Stabilizer Extent
- Math-11959 Complexity of Submodular $k$-Partition
- Math-11960 Integer Programming with Bounded Subdeterminants
- Math-11961 Extension Complexity of Inscribed Fixed-Dimensional Polytopes
- Math-11962 Arborescences Induced by Linear-Programming Pivot Rules
- Math-11963 Near-Optimal Algorithms for Mixed-Integer Convex Optimization
- Math-11964 Linear Bounds for Minimally Integer-Infeasible Systems
- Math-11965 Approximating Maximum Nonsymmetric Principal Subdeterminants
- Math-11966 Better-Than-Two Approximation for Multiplicative Connectivity Augmentation
- Math-11967 Balanced Signings in the Subtour Polytope
- Math-11968 Compact Representations of Four-Thirds Near-Mincuts
- Math-11969 Better Approximations for Unrelated Graph Balancing
- Math-11970 Deterministic Optimization of Top-$k$ Perfect-Matching Edges
- Math-11971 Property Testing for Noncommutative Quantum Functions
- Math-11972 Algebraic and Graph-Property Tests for Quantum Functions
- Math-11973 Canonical Paths Versus Spectral Independence
- Math-11974 Good Locally Testable Quantum Codes and Linear-Rate PCPs
- Math-11975 Convergence and Effective Rates of Unwinding Series
- Math-11976 Phase Retrieval from Gabor and Wavelet Magnitudes
- Math-11977 Optimal Neural-Network Depth for Sparse Recovery
- Math-11978 LOCAL Coloring Complexity and Constant-Round Decidability on Trees
- Math-11979 Algebraic Complexity of Borel Constraint Problems
- Math-11980 Determinacy Methods in LOCAL and Borel Coloring
- Math-11981 Local-to-Global Tensorization of Information Functionals
- Math-11982 Capacity Criteria for Arbitrarily Varying Channels with Causal State Information
- Math-11983 Decidability of Linear Information Inequalities
- Math-11984 Tight Bounds for Many-User Multiple-Access Coding
- Math-11985 Type-II Error Exponents in Distributed Hypothesis Testing
- Math-11986 Capacity and Reliability of Mismatched Decoding
- Math-11987 Convex Relaxations for Planted Graph Matching
- Math-11988 Gaussian Mean Testing under Information Constraints
- Math-11989 Enumeration and Typical Structure of $k$-SAT Functions
- Math-11990 Asymptotic Counts of Growing-Width $k$-SAT Functions
- Math-11991 Efficient Recognition of Cyclic Sumsets
- Math-11992 Norm Estimation from Asymmetric Black-Box Linear Operators
- Math-11993 Universal Approximation by One-Lipschitz Spline Networks
- Math-11994 Global Margin Maximization beyond the Neural Tangent Regime
- Math-11995 Cancellation-Sensitive Norms for Two-Layer Networks
- Math-11996 Algorithms for Amoeba Dimensions from Tropical Fans
- Math-11997 Geometric Criteria for Benign Overfitting
- Math-11998 Benign, Tempered, and Catastrophic Overfitting Regimes
- Math-11999 Duality and Convergence Rates in Lasserre Hierarchies
- Math-12000 Superpolynomial Lower Bounds for Dag-Like Resolution over Parities