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-5351 Unspecified Conic Optimization Research Problem
- Math-5352 Unspecified Flag Algebra Extremal Problem
- Math-5353 Condition-Number-Robust Low-Rank Matrix Completion
- Math-5354 Neural Network Robustness under Adversarial and Distribution Shifts
- Math-5355 Optimal Worst-Case Estimators for Signal Reconstruction
- Math-5356 Unique Genome Reconstruction from Seven Beads
- Math-5357 Enumeration and Sparsity of Growing-$k$ SAT Functions
- Math-5358 Stable Algorithms and Overlap Gaps for Friendly Bisections
- Math-5359 Reconstruction of Chromosome Structure from Contact Maps
- Math-5360 Mathematical Conjecture Generation with Machine Intelligence
- Math-5361 Interoperable Virtual Laboratories for Scientific Simulation
- Math-5362 Training-Loss Implications for Shallow Neural Networks
- Math-5363 Convergence to Implicit Geometry under Class Imbalance
- Math-5364 Neural Approximation of Strongly Convex Drifts with Linear Error
- Math-5365 Open Problems in Proof and Computational Complexity
- Math-5366 Coefficient Compression and Structured Proof-System Lower Bounds
- Math-5367 Average-Case Complexity of Clique on Sparse Graphs
- Math-5368 Spreadness as a Replacement for Sunflower Structure
- Math-5369 Restriction Condensation of Deterministic Communication Complexity
- Math-5370 Lower Bounds for Polynomial Calculus with Inverses
- Math-5371 Expressivity and Training Theory for Deep Material Networks
- Math-5372 Hedge-Supermartingale Exposition
- Math-5373 Quantum Harmonic Analysis of Data Structure
- Math-5374 Learning Data Manifolds for Augmentation and Nonlinear Components
- Math-5375 Mixing of Random Colorings on General Graphs
- Math-5376 Abelian Embeddings and Gap-CSP Integrality Gaps
- Math-5377 Output Length and Error of Seedless Extractors
- Math-5378 Autoencoder Optimization Perspectives
- Math-5379 Optimal Noiseless Rates for Max-Average-Margin Classifiers
- Math-5380 Efficient Computation of Exceptional Galois Representations
- Math-5381 Sensor-Actuator Co-Design and Distributed Controllability Algorithms
- Math-5382 Neural Networks for High-Dimensional Optimal Feedback Control
- Math-5383 Duplicate Strongly Polynomial Linear-Programming Lead-In
- Math-5384 Workshop Contents Listing for Combinatorial Optimization
- Math-5385 Finite Strategies in the Distance Game
- Math-5386 Duplicate Finite-Strategy Question for the Distance Game
- Math-5387 Duplicate Fare-Zone Approximation Question
- Math-5388 Two-Coloring Light Tournaments
- Math-5389 Duplicate Light-Tournament Two-Coloring Question
- Math-5390 Half-Integral Extreme Points for a Feedback-Vertex-Set Relaxation
- Math-5391 Duplicate Fiorini Feedback-Vertex-Set Question
- Math-5392 Generalization Guarantees for Self-Supervised Representations
- Math-5393 Adam Optimization Performance
- Math-5394 Definition of a Causal Representation
- Math-5395 Criteria for a Good Representation
- Math-5396 Minimal Assumptions for Additive Randomized Encodings
- Math-5397 Power of Shared Randomness in Distributed Computation
- Math-5398 Duplicate Distribution-Verification Question
- Math-5399 Evasive-LWE Research-Direction Discussion
- Math-5400 Cryptographic Equivalences for High-Energy Phenomena