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-11901 Decidability and Finiteness of Rational Joint Spectral Radii
- Math-11902 Efficient Moment Relaxations for Polynomial Optimization
- Math-11903 Witness Pseudorandom Functions from Witness Encryption
- Math-11904 Reusable Garbled RAM under Weaker Assumptions
- Math-11905 Polynomial-Time Minimization of K-Submodular Functions
- Math-11906 Complexity of Maximizing Initial Odd Ears
- Math-11907 Additive Integrality Gap for Ring Loading
- Math-11908 Exact Integrality Gap for Capacitated Facility Location
- Math-11909 Compact Constant-Gap Relaxations for Capacitated Facility Location
- Math-11910 Constructive Selection for Bessel Sequences
- Math-11911 Complexity of Embedding Two-Complexes in Three-Manifolds
- Math-11912 Complexity and Rank of Completely Positive Matrices
- Math-11913 Volume of the Boolean Quadric Polytope
- Math-11914 Core Points of Transitive Permutation Groups
- Math-11915 Consequences of Indistinguishability Obfuscation
- Math-11916 Accurate Answers to Adaptively Chosen Statistical Queries
- Math-11917 Randomized Communication Complexity of Distributed Triangle Detection
- Math-11918 Overlap Gaps and Algorithmic Hardness of Submatrix Detection
- Math-11919 Simultaneously Adaptive Universal Source Coding
- Math-11920 Complexity of Bray’s Involution-Centralizer Algorithm
- Math-11921 Sublinear Membership Testing in Two-Generator Matrix Groups
- Math-11922 Computing Hecke Operators for Arithmetic-Group Cohomology
- Math-11923 Security of Interactive Lattice-Based Group Key Exchange
- Math-11924 Assumptions and Function Classes for Function Secret Sharing
- Math-11925 Round Complexity of Non-Malleable Commitments
- Math-11926 Average-Case Hardness of Quasi-Cyclic Code Problems
- Math-11927 Sampling Complexity of Hyperbolic-Cross Approximation
- Math-11928 Resolution Lower Bounds for Clique Certification
- Math-11929 Practical Sum-of-Squares Tensor Completion
- Math-11930 Information–Computation Gaps in Sparse Linear Regression
- Math-11931 Global Optimization of Overparameterized Shallow Networks
- Math-11932 Extrapolating Clusterings from Semidefinite Subsamples
- Math-11933 Local Approximation of Random-Graph Semidefinite Programs
- Math-11934 Uniqueness of Equilibria in Rank-One Bimatrix Games
- Math-11935 Proximity and Sparsity of Optimal Integer Solutions
- Math-11936 Convergence Rates for Convex-Body Bounds
- Math-11937 Fast Low-Rank Maximum-Weight Assignment
- Math-11938 Integrality Gaps for Directed Linear k-Cut
- Math-11939 Hardness of Root-Dependent Spanning-Tree Optimization
- Math-11940 Hardness of Path-Cost Arborescence Optimization
- Math-11941 Polynomial-Time Comparison of Sparse Algebraic Power Sums
- Math-11942 Degree-Utility Optimization in Graphs
- Math-11943 Real Tau Conjecture for Depth-Four Circuits
- Math-11944 Karchmer–Raz–Wigderson Composition Conjecture
- Math-11945 Subquadratic Approximation for Longest Common Subsequences
- Math-11946 Geometric Explanations and Polynomial Pivot Rules for Simplex
- Math-11947 Sharp Smoothed Complexity of Simplex Pivot Rules
- Math-11948 Theta Invariants and New Families of MRD Codes
- Math-11949 Explicit RIP Matrices Beyond Square-Root Sparsity
- Math-11950 Square-Root Sparsity for Explicit RIP Matrices