Computer Science
Open problems, research attempts and community review.
The Top Open Problems editorial order restricted to Computer Science, followed by cross-listed economics entries. Existing relative order is retained, with provisional placements for new game-learning questions; most entries have no individual difficulty assessment. 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.
918 records · Search and filter
- CS-451 Mathematics of Quantum Computing
- CS-452 Game Theory at Scale
- CS-453 Computation at Scale
- CS-454 Computational Duality
- CS-455 Occam's Razor in Many Dimensions
- CS-456 10 Lectures and 42 Open Problems — Open Problem 3.3
- CS-457 10 Lectures and 42 Open Problems — Certifying the Restricted Isometry Property
- CS-458 10 Lectures and 42 Open Problems — Angular Synchronization via Projected Power Method
- CS-459 3.10 (Futer, Schleimer) — A practical 3-manifold homeomorphism algorithm
- CS-460 5.8 (Schleimer) — Why SnapPy works in practice
- CS-461 A malformed composite record and an Artin--Schreier certificate family
- CS-462 Source repair and a sharp quadratic specialization theorem
- CS-463 Exact ridge reduction for Lévy PIDEs
- CS-464 Nuisance-adjusted information for semiparametric MRS design
- CS-465 Bellman residuals, policy performance, and coverage
- CS-466 A finite-sample Rao-Blackwell diagnostic between Kalman and particle filtering
- CS-467 Exact support and trace-controlled ellipsoidal reachability
- CS-468 From an approximate HJB value to implemented control
- CS-469 Certified weak-coupling tubes for structured reachability
- CS-470 Finite-switch implementation of chattering controls
- CS-471 An intrinsic-dimension certificate for projected Hamilton--Jacobi equations
- CS-472 Coordinate-covariant orientation laws for no-trade regions
- CS-473 When frequency selectivity can and cannot improve multi-user capacity
- CS-474 What is actually exponential in single-carrier equalization?
- CS-475 Degree-two-and-three Markov basis for the Birkhoff ranking model
- CS-476 Indispensable cubics and a five-move Markov basis on the zero-middle-row face
- CS-477 Two fixed odds ratios form a line segment, with a complete boundary audit
- CS-478 A binary-collapse-invisible likelihood face
- CS-479 Exact endpoint and stability census for the symmetric triangle
- CS-480 Sufficient releases, conditional fibers, and incompatible Gibbs updates
- CS-481 Exact cumulant ideal of the normalized binary four-cycle
- CS-482 BIC evidence, mixture singularities, and an exact quotient diagnostic
- CS-483 Algebraic fibers and sharp sets for missing categorical data
- CS-484 Determinantal certificates for safe categorical collapse before multiple imputation
- CS-485 A zero-dimensional parity independence variety
- CS-486 Behrens–Fisher likelihood equations and an equal-scatter bifurcation
- CS-487 Semialgebraic stratification of maximum likelihood
- CS-488 Vertex flattenings generate the phylogenetic ideal
- CS-489 The stochastic image of a binary phylogenetic tripod
- CS-490 Generator-invariant local efficacy for phylogenetic invariants
- CS-491 A joint tree and JC69/K80 selector with a finite-sample certificate
- CS-492 A precise probabilistic repair and algebraic criteria for interval cell spectra
- CS-493 An ancestral-observation certificate for likelihood unimodality
- CS-494 A support-aware exchange between levels and binary variables
- CS-495 When flattening and symmetry-aware collapse are informative
- CS-496 Algebraic certificates for nonparametric mixture likelihood
- CS-497 A four-point counterexample and the border-basis repair
- CS-498 An exact witness and certificate for a recorded negative answer
- CS-499 Localization and Fourier coordinates beyond polynomial models
- CS-500 Gaussian conditional independence as an algebraic minor