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-4651 Optimal Neural-Network Depth for Sparse Recovery
- Math-4652 LOCAL Coloring Complexity and Constant-Round Decidability on Trees
- Math-4653 Algebraic Complexity of Borel Constraint Problems
- Math-4654 Determinacy Methods in LOCAL and Borel Coloring
- Math-4655 Local-to-Global Tensorization of Information Functionals
- Math-4656 Capacity Criteria for Arbitrarily Varying Channels with Causal State Information
- Math-4657 Decidability of Linear Information Inequalities
- Math-4658 Tight Bounds for Many-User Multiple-Access Coding
- Math-4659 Type-II Error Exponents in Distributed Hypothesis Testing
- Math-4660 Capacity and Reliability of Mismatched Decoding
- Math-4661 Convex Relaxations for Planted Graph Matching
- Math-4662 Gaussian Mean Testing under Information Constraints
- Math-4663 Enumeration and Typical Structure of $k$-SAT Functions
- Math-4664 Asymptotic Counts of Growing-Width $k$-SAT Functions
- Math-4665 Efficient Recognition of Cyclic Sumsets
- Math-4666 Norm Estimation from Asymmetric Black-Box Linear Operators
- Math-4667 Universal Approximation by One-Lipschitz Spline Networks
- Math-4668 Global Margin Maximization beyond the Neural Tangent Regime
- Math-4669 Cancellation-Sensitive Norms for Two-Layer Networks
- Math-4670 Algorithms for Amoeba Dimensions from Tropical Fans
- Math-4671 Geometric Criteria for Benign Overfitting
- Math-4672 Benign, Tempered, and Catastrophic Overfitting Regimes
- Math-4673 Duality and Convergence Rates in Lasserre Hierarchies
- Math-4674 Superpolynomial Lower Bounds for Dag-Like Resolution over Parities
- Math-4675 Fractional Coefficient Savings in Algebraic Proof Systems
- Math-4676 Circuit-Size Hierarchy in Bounded Arithmetic
- Math-4677 Online Model Selection for Nonparametric Classes
- Math-4678 Global Convergence of Low-Rank Multi-Penalty Optimization
- Math-4679 Pre-Asymptotic Sampling Numbers of Barron Spaces
- Math-4680 Near-Linear Subgraph Isomorphism for Acyclic Patterns
- Math-4681 Mixing Times from Spectral Independence
- Math-4682 Unconditionally Ruling Out Heuristica
- Math-4683 Semi-Supervised Sparse Gaussian Classification
- Math-4684 Moment-SOS Convergence for PDE-Constrained Variational Problems
- Math-4685 Quasilinear Finite-Field Polynomial Multiplication
- Math-4686 Adjoint-Free Approximation of Nonsymmetric Low-Rank Matrices
- Math-4687 Nash Equilibria over Unbounded Measure Spaces
- Math-4688 Integer Feasibility with Bounded Subdeterminants
- Math-4689 Fixed-Parameter Tractability of Zonotope Containment
- Math-4690 Approximating Fare-Zone Assignment on Trees
- Math-4691 Foundational Assumptions for Obfuscation, FHE, and SNARGs
- Math-4692 Efficient Verification of Distribution Properties
- Math-4693 Information-Theoretic Additive Randomized Encodings
- Math-4694 Degree Automatability of Sum-of-Squares Proofs
- Math-4695 Complexity-Bounded Computation of Maximum Destabilizing Subgroups
- Math-4696 Minimal Convex Difference Decompositions of CPWL Functions
- Math-4697 Freeness of Two-Generator Integral Matrix Groups
- Math-4698 Near-Linear List Decoding of AEL and Ta-Shma Codes
- Math-4699 Zero Submatrices in Sparse Low-Rank Matrices
- Math-4700 Optimal Bounds for Pairs of Commuting Integer Matrices