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-12601 Composite Repetition of Three Matroid Questions
- Math-12602 Competitiveness of High-Order Hybridizable DG Wave Methods
- Math-12603 Differential-Privacy Workshop Framing
- Math-12604 Useful Differential-Privacy Framing
- Math-12605 Private-Data-Analysis Framing
- Math-12606 Polynomial Freiman–Ruzsa Conjecture over Binary Vector Spaces
- Math-12607 Machine-Learning Algorithms Results Report
- Math-12608 Cryptographic Replacement of Pseudorandom Steganographic Functions
- Math-12609 Interior Maximizers of Mixed Characteristic Polynomials
- Math-12610 Robust Spectral Tensor Methods for Latent-Variable Learning
- Math-12611 Hardness Amplification by Exponent Noise
- Math-12612 Optimal Fair Multiparty Coin Flipping
- Math-12613 Depth-Independent Attribute-Based Encryption
- Math-12614 Complexity of Extremality Testing in Infinite Group Problems
- Math-12615 Combinatorial Decompositions of the All-Ones Vector
- Math-12616 Dimension Gaps in Lattice Reductions to Learning with Errors
- Math-12617 Open Problems in Mixed-Integer Nonlinear Optimization
- Math-12618 Convexification and Complexity in Mixed-Integer Optimization
- Math-12619 Unspecified Convex-Hull Conjecture for a Pooling Relaxation
- Math-12620 Numerical Simulation of Dislocation Polygonization
- Math-12621 Karchmer–Raz–Wigderson Formula Lower-Bound Conjecture
- Math-12622 Limits of False Discovery Control in Interactive Analysis
- Math-12623 Refutation Lower Bounds for Random k-SAT Instances
- Math-12624 Depth-Three Lower Bounds for an Explicit Trilinear Function
- Math-12625 Applications of Noncommutative F5 Gröbner Bases
- Math-12626 Subexponential Completeness Testing for Voronoi Cell Representatives
- Math-12627 Discrete Vector Fields for Voronoi-Cohomology Computations
- Math-12628 Error-Free Multiparty Homomorphic Secret Sharing
- Math-12629 Achievable Relations in Multi-Key Ciphertext Transformations
- Math-12630 Reducing the Exponential Tower in Constructive Degree Bounds
- Math-12631 Cutting Planes Lower Bounds for Random CNF Formulas
- Math-12632 Bit-Width-Independent Verification of Integer Multipliers
- Math-12633 Random CNF Lower Bounds beyond Cutting Planes
- Math-12634 PSD Rank Bounds for Polynomial-Size Selector Matrices
- Math-12635 Ordered-Median Facility Location
- Math-12636 Certificates of Polynomial Nonnegativity in Copositive Optimization
- Math-12637 Deterministic Components of Stochastic Optimization
- Math-12638 Unified Simplicity Models for Massive Inverse Problems
- Math-12639 Provable Advantages of Convolutional Arithmetic Circuits
- Math-12640 Statistical Recovery of High-Dimensional Network Structure
- Math-12641 Local Algorithms for Semidefinite Programming
- Math-12642 Polynomial-Time Estimation in Binary Latent-Variable Models
- Math-12643 The Polynomial Hirsch Conjecture
- Math-12644 Defining High-Dimensional Expanders Through Local Spectra
- Math-12645 Explicit Equations Separating Matrix Multiplication from Low-Rank Tensors
- Math-12646 Sequential Decoding of Nonbinary Convolutional Codes
- Math-12647 Convolutional Codes for Retrieval, Sensing, and Rank Metrics
- Math-12648 Restricted Models of Vertex-Distribution-Free Testing
- Math-12649 Automatic Recognition of Numerically Unstable Quadratic Programs
- Math-12650 Adaptive Refinement and Global Optimization of Topological Shapes