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.
6,343 records · Search and filter
- Math-5301 Discrete Vector Fields for Voronoi-Cohomology Computations
- Math-5302 Error-Free Multiparty Homomorphic Secret Sharing
- Math-5303 Achievable Relations in Multi-Key Ciphertext Transformations
- Math-5304 Reducing the Exponential Tower in Constructive Degree Bounds
- Math-5305 Cutting Planes Lower Bounds for Random CNF Formulas
- Math-5306 Bit-Width-Independent Verification of Integer Multipliers
- Math-5307 Random CNF Lower Bounds beyond Cutting Planes
- Math-5308 PSD Rank Bounds for Polynomial-Size Selector Matrices
- Math-5309 Ordered-Median Facility Location
- Math-5310 Certificates of Polynomial Nonnegativity in Copositive Optimization
- Math-5311 Deterministic Components of Stochastic Optimization
- Math-5312 Unified Simplicity Models for Massive Inverse Problems
- Math-5313 Provable Advantages of Convolutional Arithmetic Circuits
- Math-5314 Statistical Recovery of High-Dimensional Network Structure
- Math-5315 Local Algorithms for Semidefinite Programming
- Math-5316 Polynomial-Time Estimation in Binary Latent-Variable Models
- Math-5317 The Polynomial Hirsch Conjecture
- Math-5318 Defining High-Dimensional Expanders Through Local Spectra
- Math-5319 Explicit Equations Separating Matrix Multiplication from Low-Rank Tensors
- Math-5320 Sequential Decoding of Nonbinary Convolutional Codes
- Math-5321 Convolutional Codes for Retrieval, Sensing, and Rank Metrics
- Math-5322 Restricted Models of Vertex-Distribution-Free Testing
- Math-5323 Automatic Recognition of Numerically Unstable Quadratic Programs
- Math-5324 Adaptive Refinement and Global Optimization of Topological Shapes
- Math-5325 Low-Temperature Sampling by Randomly Initialized Glauber Dynamics
- Math-5326 Multiplicity Obstructions in Geometric Complexity Theory
- Math-5327 Primal and Dual Geometry of SONC Relaxations
- Math-5328 Global Optimality of Domain-Decomposition Transport Algorithms
- Math-5329 Robustness-Driven Overparameterization in Two-Layer Neural Networks
- Math-5330 Geometric Analogues of Finite Effective Complexity
- Math-5331 Comparative Advantages of Physics-Based and Machine-Learned Models
- Math-5332 High-Dimensional Regression and PDE Learning Without Dimensional Curse
- Math-5333 Algorithms for Symmetry-Reduced Semidefinite Programs
- Math-5334 Quantum Complexity of High-Precision Matrix Scaling
- Math-5335 Unspecified Combinatorial Optimization Problem
- Math-5336 Half-Integral Extreme Points for Feedback Vertex Set
- Math-5337 Approximating Submodular Functions by Matroid Rank Functions
- Math-5338 Probabilistic Box Models
- Math-5339 Dimension–Complexity Tradeoffs in Quantum-Function Testing
- Math-5340 Average-Case Metacomplexity Characterizations of One-Way Functions
- Math-5341 Size-Efficient Circuits Resilient to Short-Circuit Errors
- Math-5342 Rank Dependence of Sample Complexity in Matrix Sensing
- Math-5343 Computable Neural-Network Approximation from Noisy Samples
- Math-5344 Computable Ground Truths for Learning Problems
- Math-5345 Stochasticity and Sample Complexity in Neural Networks
- Math-5346 Open Problems in Local Graph Complexity
- Math-5347 Constraint-Satisfaction Table Caption
- Math-5348 Reduction of Guessing Problems to Source Compression
- Math-5349 Universal Compression with Large Unknown Alphabets
- Math-5350 Mutual-Information Bounds and Dimension-Free Dual Sudakov Minoration