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-5251 Runtime Thresholds for Ant-Colony Optimization
- Math-5252 Tangency Handling in Telea Image Inpainting
- Math-5253 Computational Complexity of Bruhat-Interval Invariants
- Math-5254 Semialgebraic Homeomorphism Types at Fixed Complexity
- Math-5255 Boolean Evaluation and Arithmetic-Circuit Complexity
- Math-5256 Antisymmetric Association Schemes and Polynomial Factoring
- Math-5257 Universal Semantic Communication Across Different Meanings
- Math-5258 Fast Instance-Optimal Decoders for Compressed Sensing
- Math-5259 Learning Capacity of Totally Geodesic Map Families
- Math-5260 Faster Rank-Two Parametric Assignment
- Math-5261 Capacity-Preserving Conversion to Unsplittable Flows
- Math-5262 Reliable Model Reduction for Nonlinear Parameterized Systems
- Math-5263 Expansion-Point Selection in Time-Domain Model Reduction
- Math-5264 State Recovery from Quantized Nonlinear Trajectories
- Math-5265 Connectivity Reconstruction in Large Neuronal Networks
- Math-5266 Polymorphism Characterization of Constraint Approximation Thresholds
- Math-5267 Explicit Deterministic Restricted Isometry Matrices
- Math-5268 Sample Complexity of Active Coordinate Identification
- Math-5269 Fundamental-Domain Choice in Symmetric Integer Programming
- Math-5270 General Effectiveness of Symmetry-Aware Polyhedral Pivoting
- Math-5271 Polyhedral Information Derived from Known Symmetries
- Math-5272 Fast Solvers for the Electronic Schrödinger Equation
- Math-5273 Low-Rank Subexponential Electronic-Structure Algorithms
- Math-5274 Predicting SAT-Solver Hardness from Formula Structure
- Math-5275 Composite Repetition of Three Matroid Questions
- Math-5276 Competitiveness of High-Order Hybridizable DG Wave Methods
- Math-5277 Differential-Privacy Workshop Framing
- Math-5278 Useful Differential-Privacy Framing
- Math-5279 Private-Data-Analysis Framing
- Math-5280 Polynomial Freiman–Ruzsa Conjecture over Binary Vector Spaces
- Math-5281 Machine-Learning Algorithms Results Report
- Math-5282 Cryptographic Replacement of Pseudorandom Steganographic Functions
- Math-5283 Interior Maximizers of Mixed Characteristic Polynomials
- Math-5284 Robust Spectral Tensor Methods for Latent-Variable Learning
- Math-5285 Hardness Amplification by Exponent Noise
- Math-5286 Optimal Fair Multiparty Coin Flipping
- Math-5287 Depth-Independent Attribute-Based Encryption
- Math-5288 Complexity of Extremality Testing in Infinite Group Problems
- Math-5289 Combinatorial Decompositions of the All-Ones Vector
- Math-5290 Dimension Gaps in Lattice Reductions to Learning with Errors
- Math-5291 Open Problems in Mixed-Integer Nonlinear Optimization
- Math-5292 Convexification and Complexity in Mixed-Integer Optimization
- Math-5293 Unspecified Convex-Hull Conjecture for a Pooling Relaxation
- Math-5294 Numerical Simulation of Dislocation Polygonization
- Math-5295 Karchmer–Raz–Wigderson Formula Lower-Bound Conjecture
- Math-5296 Limits of False Discovery Control in Interactive Analysis
- Math-5297 Refutation Lower Bounds for Random k-SAT Instances
- Math-5298 Depth-Three Lower Bounds for an Explicit Trilinear Function
- Math-5299 Applications of Noncommutative F5 Gröbner Bases
- Math-5300 Subexponential Completeness Testing for Voronoi Cell Representatives