Computer science
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.
83 records · Search and filter
- Math-314 10 Lectures and 42 Open Problems — The Grothendieck Constant
- Math-1169 Sums of independent random variables with unbounded variance
- Math-1171 The robustness of the tensor product
- Math-2070 10 Lectures and 42 Open Problems — The Paley ETF Conjecture
- Math-2220 10 Lectures and 42 Open Problems — Mutually Unbiased Bases
- Math-3015 Zero dimension exponent for well-conditioned sampling queries
- Math-3788 10 Lectures and 42 Open Problems — Constructive Kadison-Singer
- Math-4374 10 Lectures and 42 Open Problems — Certifying that matrices are PSD
- Math-4380 8.4 (Schleimer) — Detecting reducible Heegaard splittings
- Math-4383 Zero patterns, facial sets, and exact support repair in chordal models
- Math-4390 Exact CI rationalization through rational local charts
- Math-4399 A gap-move bound and the exact decomposable-model spectrum
- Math-4400 One observable mode can lift to infinitely many hidden-parameter maxima
- Math-4402 Complex count solved, with an exact real-root cusp slice
- Math-4406 Parameter tying and exact homogeneous binary-star invariants
- Math-4407 Exact output-sensitive scaling for decomposable discrete models
- Math-4409 Exact chain gluing and a sharp cyclic incompatibility certificate
- Math-4415 Removing term order without hiding the extrapolation choice
- Math-4431 A stabilizer-aware query barrier for vectorization lower bounds
- Math-4432 The inverse-state twist interface, extraction boundary, and exact storage limit
- Math-4438 Multiple marked inputs: exclusion bounds and tight query regimes
- Math-4463 Recognition and Eutaxy Testing of Bacher Matrices
- Math-4471 Characterization of Ideal $0$–$1$ Matrices
- Math-4516 Constructive Selection for Bessel Sequences
- Math-4520 Core Points of Transitive Permutation Groups
- Math-4562 Recognition of Virtually Special Hyperbolic Three-Manifolds
- Math-4579 Canonical Paths Versus Spectral Independence
- Math-4597 Efficient Recognition of Cyclic Sumsets
- Math-4611 Pre-Asymptotic Sampling Numbers of Barron Spaces
- Math-4613 Mixing Times from Spectral Independence
- Math-4988 Computation at Scale
- Math-4989 Computational Duality
- Math-4990 Occam's Razor in Many Dimensions
- Math-4991 10 Lectures and 42 Open Problems — Open Problem 3.3
- Math-4993 10 Lectures and 42 Open Problems — Angular Synchronization via Projected Power Method
- Math-4995 5.8 (Schleimer) — Why SnapPy works in practice
- Math-4996 A malformed composite record and an Artin--Schreier certificate family
- Math-4997 Source repair and a sharp quadratic specialization theorem
- Math-4999 Nuisance-adjusted information for semiparametric MRS design
- Math-5000 Bellman residuals, policy performance, and coverage
- Math-5007 Coordinate-covariant orientation laws for no-trade regions
- Math-5014 Exact endpoint and stability census for the symmetric triangle
- Math-5020 A zero-dimensional parity independence variety
- Math-5029 A support-aware exchange between levels and binary variables
- Math-5030 When flattening and symmetry-aware collapse are informative
- Math-5032 A four-point counterexample and the border-basis repair
- Math-5033 An exact witness and certificate for a recorded negative answer
- Math-5034 Localization and Fourier coordinates beyond polynomial models
- Math-5038 Base-encoded monomial-curve designs
- Math-5039 Evaluation-rank explanation for the value of knockout time series