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-4501 A one-round action barrier and leave-one-out multiparty key routing
- Math-4502 Exact rank-one decoding and a factorized no-QRAM quantum baseline
- Math-4503 Hidden Goppa presentations versus public-code decoding
- Math-4504 Certificates for hidden Goppa structure and bounded decoding
- Math-4505 Grover optimality and a tail-profile bound for average-value search
- Math-4506 Multiple marked inputs: exclusion bounds and tight query regimes
- Math-4507 Finite-window reduction and binary-cost accounting for hidden shift on the integers
- Math-4508 A batch-fidelity obstruction in hidden-shift attacks on unique-SVP
- Math-4509 Exact period-quotient reduction and unary lift cost for hidden shift on Z^d
- Math-4510 Spectral laws for Gaussian multiple-shift states
- Math-4511 The cyclic core of Heisenberg hidden shift
- Math-4512 The real cost of the CSIDH hidden-shift attack
- Math-4513 Exact DDH leakage and sampler criteria for the CSIDH torsor
- Math-4514 Finite resource bounds for random spherical covering
- Math-4515 HHL, Macaulay conditioning, and presentation instability
- Math-4516 Offline Simon, explicit HSP instances, and a classical-transcript obstruction
- Math-4517 A localization-safe action of Weyl operators
- Math-4518 Degree-windowed Cech computation and the role of one b-function
- Math-4519 Fixed-ambient extraction of roots of finite Frobenius modules
- Math-4520 Random-access slices of free resolutions
- Math-4521 A fixed-basis semibasis certificate for DG-module interoperability
- Math-4522 Degree-local Hom computation and certified corner reuse
- Math-4523 Expected-Optimum Approximation for Random MAX $R$-3SAT
- Math-4524 Approximability and Parameterized Complexity of Steiner Forest
- Math-4525 Hardness of the $\varepsilon-Dense$ Steiner Tree Problem
- Math-4526 Complexity and Approximation of Planar Min-Bisection
- Math-4527 An FPAS for Constrained Bicriteria Spanning Trees
- Math-4528 Output-Polynomial Enumeration of Bicriteria Spanning Trees
- Math-4529 Polynomial-Time Computation of Ehrhart Periods
- Math-4530 Asymptotic Goodness of Function-Field-Tower Codes
- Math-4531 Recognition and Eutaxy Testing of Bacher Matrices
- Math-4532 Polynomial Complexity of Greedy Lattice Reduction
- Math-4533 Central-Trajectory Integral Bounds
- Math-4534 Nonadaptive Polynomial Stabilization of Minimum-Phase Linear Systems
- Math-4535 Stationary and Optimal Linear Differential Behaviors
- Math-4536 Computational Hardness of Learning Parity with Noise
- Math-4537 Quantum Hardness of Approximate Lattice Problems
- Math-4538 Three-Terminal Distance-Interdiction Complexity
- Math-4539 Characterization of Ideal $0$–$1$ Matrices
- Math-4540 Integral Primal Certificates for Submodular Minimization
- Math-4541 Recognition and Characterization of Leaf Powers
- Math-4542 Sampling Algorithms for Maximum-Cut Density
- Math-4543 Codegree Thresholds for Hypergraph Matchings
- Math-4544 Complexity of Dense Perfect Hypergraph Matching
- Math-4545 Separation of Constant-Free Valiant Classes
- Math-4546 Optimal Algebraic Immunity of Boolean Functions
- Math-4547 Explicit Polynomial Maps Escaping Low-Degree Images
- Math-4548 Half-Distance Decoding for Hypergraph Codes
- Math-4549 Multiplicity Decoding for Order-Domain Codes
- Math-4550 Quantitative Manipulability of Social Choice Functions