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-11851 Hardness of the $\varepsilon-Dense$ Steiner Tree Problem
- Math-11852 Complexity and Approximation of Planar Min-Bisection
- Math-11853 An FPAS for Constrained Bicriteria Spanning Trees
- Math-11854 Output-Polynomial Enumeration of Bicriteria Spanning Trees
- Math-11855 Polynomial-Time Computation of Ehrhart Periods
- Math-11856 Asymptotic Goodness of Function-Field-Tower Codes
- Math-11857 Recognition and Eutaxy Testing of Bacher Matrices
- Math-11858 Polynomial Complexity of Greedy Lattice Reduction
- Math-11859 Central-Trajectory Integral Bounds
- Math-11860 Nonadaptive Polynomial Stabilization of Minimum-Phase Linear Systems
- Math-11861 Stationary and Optimal Linear Differential Behaviors
- Math-11862 Computational Hardness of Learning Parity with Noise
- Math-11863 Quantum Hardness of Approximate Lattice Problems
- Math-11864 Three-Terminal Distance-Interdiction Complexity
- Math-11865 Characterization of Ideal $0$–$1$ Matrices
- Math-11866 Integral Primal Certificates for Submodular Minimization
- Math-11867 Recognition and Characterization of Leaf Powers
- Math-11868 Sampling Algorithms for Maximum-Cut Density
- Math-11869 Codegree Thresholds for Hypergraph Matchings
- Math-11870 Complexity of Dense Perfect Hypergraph Matching
- Math-11871 Separation of Constant-Free Valiant Classes
- Math-11872 Optimal Algebraic Immunity of Boolean Functions
- Math-11873 Explicit Polynomial Maps Escaping Low-Degree Images
- Math-11874 Half-Distance Decoding for Hypergraph Codes
- Math-11875 Multiplicity Decoding for Order-Domain Codes
- Math-11876 Quantitative Manipulability of Social Choice Functions
- Math-11877 Individual Manipulation Power in Neutral Social Choice
- Math-11878 Optimal Rates of Collusion-Secure Fingerprinting Codes
- Math-11879 Decidability of Simplicial-Complex Embeddability
- Math-11880 Rotational Matching Complexity for Planar Point Sets
- Math-11881 Convex-Hull Decomposition for Mixed-Integer Bipartite Systems
- Math-11882 Alcuin Numbers and Recognition of Small Boat Graphs
- Math-11883 Linear Optimization over Mixed-Integer Bipartite Systems
- Math-11884 Achievable External Behaviors Under Controller Interconnection
- Math-11885 Circular Assume–Guarantee Reasoning for General Systems
- Math-11886 Optimal Feasible Sets from Quantized Trajectory Observations
- Math-11887 Global Observability from Negative Gramian Curvature
- Math-11888 Independence and Density Thresholds for Cuckoo Hashing
- Math-11889 Sensitivity Growth Under Boolean Conjunctions
- Math-11890 Orbit-Closure Obstructions for Permanent–Determinant Separation
- Math-11891 Decidability of Universal Factor Languages
- Math-11892 Symmetry-Preserving Evaluation of Orbitwise Generating Functions
- Math-11893 Integer Carathéodory Property for Intersecting Matroid Base Polytopes
- Math-11894 Integer Carathéodory Property for Arborescence Polytopes
- Math-11895 Greedy Decomposition of the Spanning-Tree Polytope
- Math-11896 Density and Geometry Recovery from Nearest-Neighbor Graphs
- Math-11897 Polynomial-Time Algorithms for High-Dimensional Private Queries
- Math-11898 Multicolored Sunflower Conjecture over Ternary Vector Spaces
- Math-11899 Worst-Case Inputs for Smoothed Caching Complexity
- Math-11900 Polynomial Tractability of Permutation-Invariant Integration