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-401 Tight Bounds for Many-User Multiple-Access Coding
- CS-402 Type-II Error Exponents in Distributed Hypothesis Testing
- CS-403 Capacity and Reliability of Mismatched Decoding
- CS-404 Convex Relaxations for Planted Graph Matching
- CS-405 Gaussian Mean Testing under Information Constraints
- CS-406 Enumeration and Typical Structure of $k$-SAT Functions
- CS-407 Asymptotic Counts of Growing-Width $k$-SAT Functions
- CS-408 Efficient Recognition of Cyclic Sumsets
- CS-409 Norm Estimation from Asymmetric Black-Box Linear Operators
- CS-410 Universal Approximation by One-Lipschitz Spline Networks
- CS-411 Global Margin Maximization beyond the Neural Tangent Regime
- CS-412 Cancellation-Sensitive Norms for Two-Layer Networks
- CS-413 Algorithms for Amoeba Dimensions from Tropical Fans
- CS-414 Geometric Criteria for Benign Overfitting
- CS-415 Benign, Tempered, and Catastrophic Overfitting Regimes
- CS-416 Duality and Convergence Rates in Lasserre Hierarchies
- CS-417 Superpolynomial Lower Bounds for Dag-Like Resolution over Parities
- CS-418 Fractional Coefficient Savings in Algebraic Proof Systems
- CS-419 Circuit-Size Hierarchy in Bounded Arithmetic
- CS-420 Online Model Selection for Nonparametric Classes
- CS-421 Global Convergence of Low-Rank Multi-Penalty Optimization
- CS-422 Pre-Asymptotic Sampling Numbers of Barron Spaces
- CS-423 Near-Linear Subgraph Isomorphism for Acyclic Patterns
- CS-424 Mixing Times from Spectral Independence
- CS-425 Unconditionally Ruling Out Heuristica
- CS-426 Semi-Supervised Sparse Gaussian Classification
- CS-427 Moment-SOS Convergence for PDE-Constrained Variational Problems
- CS-428 Quasilinear Finite-Field Polynomial Multiplication
- CS-429 Adjoint-Free Approximation of Nonsymmetric Low-Rank Matrices
- CS-430 Nash Equilibria over Unbounded Measure Spaces
- CS-431 Integer Feasibility with Bounded Subdeterminants
- CS-432 Fixed-Parameter Tractability of Zonotope Containment
- CS-433 Approximating Fare-Zone Assignment on Trees
- CS-434 Foundational Assumptions for Obfuscation, FHE, and SNARGs
- CS-435 Efficient Verification of Distribution Properties
- CS-436 Information-Theoretic Additive Randomized Encodings
- CS-437 Degree Automatability of Sum-of-Squares Proofs
- CS-438 Complexity-Bounded Computation of Maximum Destabilizing Subgroups
- CS-439 Minimal Convex Difference Decompositions of CPWL Functions
- CS-440 Freeness of Two-Generator Integral Matrix Groups
- CS-441 Near-Linear List Decoding of AEL and Ta-Shma Codes
- CS-442 Zero Submatrices in Sparse Low-Rank Matrices
- CS-443 Optimal Bounds for Pairs of Commuting Integer Matrices
- CS-444 Quantum Advantage in Threefold Repetition of Feige’s Game
- CS-445 Semidefinite Relaxations for Quantum Equilibria
- CS-446 Universal-Cover Isomorphism Algorithms for Cube Complexes
- CS-447 Cross-Entropy Dynamics Beyond Hadamard Initialization
- CS-448 Hidden-Layer Depth Complexity of Piecewise-Linear Functions
- CS-449 Smale's 4th Problem: Integer Zeros of Polynomials
- CS-450 Beyond Convex Optimization