Mathematics
Open problems, research attempts and community review.
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,288 records · Search and filter
- Math-5201 Antisymmetric Association Schemes and Polynomial Factoring
- Math-5202 Universal Semantic Communication Across Different Meanings
- Math-5203 Fast Instance-Optimal Decoders for Compressed Sensing
- Math-5204 Learning Capacity of Totally Geodesic Map Families
- Math-5205 Faster Rank-Two Parametric Assignment
- Math-5206 Capacity-Preserving Conversion to Unsplittable Flows
- Math-5207 Reliable Model Reduction for Nonlinear Parameterized Systems
- Math-5208 Expansion-Point Selection in Time-Domain Model Reduction
- Math-5209 State Recovery from Quantized Nonlinear Trajectories
- Math-5210 Connectivity Reconstruction in Large Neuronal Networks
- Math-5211 Polymorphism Characterization of Constraint Approximation Thresholds
- Math-5212 Explicit Deterministic Restricted Isometry Matrices
- Math-5213 Sample Complexity of Active Coordinate Identification
- Math-5214 Fundamental-Domain Choice in Symmetric Integer Programming
- Math-5215 General Effectiveness of Symmetry-Aware Polyhedral Pivoting
- Math-5216 Polyhedral Information Derived from Known Symmetries
- Math-5217 Fast Solvers for the Electronic Schrödinger Equation
- Math-5218 Low-Rank Subexponential Electronic-Structure Algorithms
- Math-5219 Predicting SAT-Solver Hardness from Formula Structure
- Math-5220 Composite Repetition of Three Matroid Questions
- Math-5221 Competitiveness of High-Order Hybridizable DG Wave Methods
- Math-5222 Differential-Privacy Workshop Framing
- Math-5223 Useful Differential-Privacy Framing
- Math-5224 Private-Data-Analysis Framing
- Math-5225 Polynomial Freiman–Ruzsa Conjecture over Binary Vector Spaces
- Math-5226 Machine-Learning Algorithms Results Report
- Math-5227 Cryptographic Replacement of Pseudorandom Steganographic Functions
- Math-5228 Interior Maximizers of Mixed Characteristic Polynomials
- Math-5229 Robust Spectral Tensor Methods for Latent-Variable Learning
- Math-5230 Hardness Amplification by Exponent Noise
- Math-5231 Optimal Fair Multiparty Coin Flipping
- Math-5232 Depth-Independent Attribute-Based Encryption
- Math-5233 Complexity of Extremality Testing in Infinite Group Problems
- Math-5234 Combinatorial Decompositions of the All-Ones Vector
- Math-5235 Dimension Gaps in Lattice Reductions to Learning with Errors
- Math-5236 Open Problems in Mixed-Integer Nonlinear Optimization
- Math-5237 Convexification and Complexity in Mixed-Integer Optimization
- Math-5238 Unspecified Convex-Hull Conjecture for a Pooling Relaxation
- Math-5239 Numerical Simulation of Dislocation Polygonization
- Math-5240 Karchmer–Raz–Wigderson Formula Lower-Bound Conjecture
- Math-5241 Limits of False Discovery Control in Interactive Analysis
- Math-5242 Refutation Lower Bounds for Random k-SAT Instances
- Math-5243 Depth-Three Lower Bounds for an Explicit Trilinear Function
- Math-5244 Applications of Noncommutative F5 Gröbner Bases
- Math-5245 Subexponential Completeness Testing for Voronoi Cell Representatives
- Math-5246 Discrete Vector Fields for Voronoi-Cohomology Computations
- Math-5247 Error-Free Multiparty Homomorphic Secret Sharing
- Math-5248 Achievable Relations in Multi-Key Ciphertext Transformations
- Math-5249 Reducing the Exponential Tower in Constructive Degree Bounds
- Math-5250 Cutting Planes Lower Bounds for Random CNF Formulas