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-4551 Individual Manipulation Power in Neutral Social Choice
- Math-4552 Optimal Rates of Collusion-Secure Fingerprinting Codes
- Math-4553 Decidability of Simplicial-Complex Embeddability
- Math-4554 Rotational Matching Complexity for Planar Point Sets
- Math-4555 Convex-Hull Decomposition for Mixed-Integer Bipartite Systems
- Math-4556 Alcuin Numbers and Recognition of Small Boat Graphs
- Math-4557 Linear Optimization over Mixed-Integer Bipartite Systems
- Math-4558 Achievable External Behaviors Under Controller Interconnection
- Math-4559 Circular Assume–Guarantee Reasoning for General Systems
- Math-4560 Optimal Feasible Sets from Quantized Trajectory Observations
- Math-4561 Global Observability from Negative Gramian Curvature
- Math-4562 Independence and Density Thresholds for Cuckoo Hashing
- Math-4563 Sensitivity Growth Under Boolean Conjunctions
- Math-4564 Orbit-Closure Obstructions for Permanent–Determinant Separation
- Math-4565 Decidability of Universal Factor Languages
- Math-4566 Symmetry-Preserving Evaluation of Orbitwise Generating Functions
- Math-4567 Integer Carathéodory Property for Intersecting Matroid Base Polytopes
- Math-4568 Integer Carathéodory Property for Arborescence Polytopes
- Math-4569 Greedy Decomposition of the Spanning-Tree Polytope
- Math-4570 Density and Geometry Recovery from Nearest-Neighbor Graphs
- Math-4571 Polynomial-Time Algorithms for High-Dimensional Private Queries
- Math-4572 Multicolored Sunflower Conjecture over Ternary Vector Spaces
- Math-4573 Worst-Case Inputs for Smoothed Caching Complexity
- Math-4574 Polynomial Tractability of Permutation-Invariant Integration
- Math-4575 Decidability and Finiteness of Rational Joint Spectral Radii
- Math-4576 Efficient Moment Relaxations for Polynomial Optimization
- Math-4577 Witness Pseudorandom Functions from Witness Encryption
- Math-4578 Reusable Garbled RAM under Weaker Assumptions
- Math-4579 Polynomial-Time Minimization of K-Submodular Functions
- Math-4580 Complexity of Maximizing Initial Odd Ears
- Math-4581 Additive Integrality Gap for Ring Loading
- Math-4582 Exact Integrality Gap for Capacitated Facility Location
- Math-4583 Compact Constant-Gap Relaxations for Capacitated Facility Location
- Math-4584 Constructive Selection for Bessel Sequences
- Math-4585 Complexity of Embedding Two-Complexes in Three-Manifolds
- Math-4586 Complexity and Rank of Completely Positive Matrices
- Math-4587 Volume of the Boolean Quadric Polytope
- Math-4588 Core Points of Transitive Permutation Groups
- Math-4589 Consequences of Indistinguishability Obfuscation
- Math-4590 Accurate Answers to Adaptively Chosen Statistical Queries
- Math-4591 Randomized Communication Complexity of Distributed Triangle Detection
- Math-4592 Overlap Gaps and Algorithmic Hardness of Submatrix Detection
- Math-4593 Simultaneously Adaptive Universal Source Coding
- Math-4594 Complexity of Bray’s Involution-Centralizer Algorithm
- Math-4595 Sublinear Membership Testing in Two-Generator Matrix Groups
- Math-4596 Computing Hecke Operators for Arithmetic-Group Cohomology
- Math-4597 Security of Interactive Lattice-Based Group Key Exchange
- Math-4598 Assumptions and Function Classes for Function Secret Sharing
- Math-4599 Round Complexity of Non-Malleable Commitments
- Math-4600 Average-Case Hardness of Quasi-Cyclic Code Problems