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-12551 Breach-centered sampling of IBL classroom culture
- Math-12552 Identification and repair of an AB/BA proof-learning study
- Math-12553 A causal design for long-term effects of Modified Moore Method instruction on baseline-strong students
- Math-12554 Optimization with Inexact Real-Valued Inputs
- Math-12555 Duplicate Planar Min-Bisection and Bicriteria Extraction
- Math-12556 Duplicate Bicriteria Spanning-Tree Enumeration
- Math-12557 Fourier Reconstruction of Discrete Objects
- Math-12558 Semaev's Auxiliary Elliptic-Curve Index-Calculus Algorithm
- Math-12559 Robust Radio-Network Planning Under Traffic Misspecification
- Math-12560 Prox-Regularity of Polynomial Stability Abscissas
- Math-12561 Sharper Complexity Bounds for Full-Newton Interior-Point Methods
- Math-12562 Intrinsic Nonlinear Model Reduction
- Math-12563 Interpolation-Point Selection in Rational Krylov Reduction
- Math-12564 Observability for Polynomial Systems
- Math-12565 Threshold-Avoiding Control for Bank Capital Ratios
- Math-12566 Redundant Extraction — Bank Capital-Ratio Control
- Math-12567 Application-Independent Parallel Algorithms for Directed Grid Dependencies
- Math-12568 Hardness of Decoding Random Linear Codes
- Math-12569 Rhetorical Quantum-State Vector-Length Question
- Math-12570 Exponential Tree Size of Cluster States
- Math-12571 Resolved Triple-Product Group Challenge
- Math-12572 Space-Efficient Lattice-Basis Reduction
- Math-12573 Practical Strength of Lift-and-Project Relaxations
- Math-12574 Integrality-Gap Reduction by Lift-and-Project Closures
- Math-12575 Higher-Row Cuts from Cylindrical Simplices
- Math-12576 Symmetry-Aware Rank-One Convex Interpolation Algorithms
- Math-12577 Runtime Thresholds for Ant-Colony Optimization
- Math-12578 Tangency Handling in Telea Image Inpainting
- Math-12579 Computational Complexity of Bruhat-Interval Invariants
- Math-12580 Semialgebraic Homeomorphism Types at Fixed Complexity
- Math-12581 Boolean Evaluation and Arithmetic-Circuit Complexity
- Math-12582 Antisymmetric Association Schemes and Polynomial Factoring
- Math-12583 Universal Semantic Communication Across Different Meanings
- Math-12584 Fast Instance-Optimal Decoders for Compressed Sensing
- Math-12585 Learning Capacity of Totally Geodesic Map Families
- Math-12586 Faster Rank-Two Parametric Assignment
- Math-12587 Capacity-Preserving Conversion to Unsplittable Flows
- Math-12588 Reliable Model Reduction for Nonlinear Parameterized Systems
- Math-12589 Expansion-Point Selection in Time-Domain Model Reduction
- Math-12590 State Recovery from Quantized Nonlinear Trajectories
- Math-12591 Connectivity Reconstruction in Large Neuronal Networks
- Math-12592 Polymorphism Characterization of Constraint Approximation Thresholds
- Math-12593 Explicit Deterministic Restricted Isometry Matrices
- Math-12594 Sample Complexity of Active Coordinate Identification
- Math-12595 Fundamental-Domain Choice in Symmetric Integer Programming
- Math-12596 General Effectiveness of Symmetry-Aware Polyhedral Pivoting
- Math-12597 Polyhedral Information Derived from Known Symmetries
- Math-12598 Fast Solvers for the Electronic Schrödinger Equation
- Math-12599 Low-Rank Subexponential Electronic-Structure Algorithms
- Math-12600 Predicting SAT-Solver Hardness from Formula Structure