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-12651 Low-Temperature Sampling by Randomly Initialized Glauber Dynamics
- Math-12652 Multiplicity Obstructions in Geometric Complexity Theory
- Math-12653 Primal and Dual Geometry of SONC Relaxations
- Math-12654 Global Optimality of Domain-Decomposition Transport Algorithms
- Math-12655 Robustness-Driven Overparameterization in Two-Layer Neural Networks
- Math-12656 Geometric Analogues of Finite Effective Complexity
- Math-12657 Comparative Advantages of Physics-Based and Machine-Learned Models
- Math-12658 High-Dimensional Regression and PDE Learning Without Dimensional Curse
- Math-12659 Algorithms for Symmetry-Reduced Semidefinite Programs
- Math-12660 Quantum Complexity of High-Precision Matrix Scaling
- Math-12661 Unspecified Combinatorial Optimization Problem
- Math-12662 Half-Integral Extreme Points for Feedback Vertex Set
- Math-12663 Approximating Submodular Functions by Matroid Rank Functions
- Math-12664 Probabilistic Box Models
- Math-12665 Dimension–Complexity Tradeoffs in Quantum-Function Testing
- Math-12666 Average-Case Metacomplexity Characterizations of One-Way Functions
- Math-12667 Size-Efficient Circuits Resilient to Short-Circuit Errors
- Math-12668 Rank Dependence of Sample Complexity in Matrix Sensing
- Math-12669 Computable Neural-Network Approximation from Noisy Samples
- Math-12670 Computable Ground Truths for Learning Problems
- Math-12671 Stochasticity and Sample Complexity in Neural Networks
- Math-12672 Open Problems in Local Graph Complexity
- Math-12673 Constraint-Satisfaction Table Caption
- Math-12674 Reduction of Guessing Problems to Source Compression
- Math-12675 Universal Compression with Large Unknown Alphabets
- Math-12676 Mutual-Information Bounds and Dimension-Free Dual Sudakov Minoration
- Math-12677 Unspecified Conic Optimization Research Problem
- Math-12678 Unspecified Flag Algebra Extremal Problem
- Math-12679 Condition-Number-Robust Low-Rank Matrix Completion
- Math-12680 Neural Network Robustness under Adversarial and Distribution Shifts
- Math-12681 Optimal Worst-Case Estimators for Signal Reconstruction
- Math-12682 Unique Genome Reconstruction from Seven Beads
- Math-12683 Enumeration and Sparsity of Growing-$k$ SAT Functions
- Math-12684 Stable Algorithms and Overlap Gaps for Friendly Bisections
- Math-12685 Reconstruction of Chromosome Structure from Contact Maps
- Math-12686 Mathematical Conjecture Generation with Machine Intelligence
- Math-12687 Interoperable Virtual Laboratories for Scientific Simulation
- Math-12688 Training-Loss Implications for Shallow Neural Networks
- Math-12689 Convergence to Implicit Geometry under Class Imbalance
- Math-12690 Neural Approximation of Strongly Convex Drifts with Linear Error
- Math-12691 Open Problems in Proof and Computational Complexity
- Math-12692 Coefficient Compression and Structured Proof-System Lower Bounds
- Math-12693 Average-Case Complexity of Clique on Sparse Graphs
- Math-12694 Spreadness as a Replacement for Sunflower Structure
- Math-12695 Restriction Condensation of Deterministic Communication Complexity
- Math-12696 Lower Bounds for Polynomial Calculus with Inverses
- Math-12697 Expressivity and Training Theory for Deep Material Networks
- Math-12698 Hedge-Supermartingale Exposition
- Math-12699 Quantum Harmonic Analysis of Data Structure
- Math-12700 Learning Data Manifolds for Augmentation and Nonlinear Components