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-701 Reducing the Exponential Tower in Constructive Degree Bounds
- CS-702 Cutting Planes Lower Bounds for Random CNF Formulas
- CS-703 Bit-Width-Independent Verification of Integer Multipliers
- CS-704 Random CNF Lower Bounds beyond Cutting Planes
- CS-705 PSD Rank Bounds for Polynomial-Size Selector Matrices
- CS-706 Ordered-Median Facility Location
- CS-707 Certificates of Polynomial Nonnegativity in Copositive Optimization
- CS-708 Deterministic Components of Stochastic Optimization
- CS-709 Unified Simplicity Models for Massive Inverse Problems
- CS-710 Provable Advantages of Convolutional Arithmetic Circuits
- CS-711 Statistical Recovery of High-Dimensional Network Structure
- CS-712 Local Algorithms for Semidefinite Programming
- CS-713 Polynomial-Time Estimation in Binary Latent-Variable Models
- CS-714 The Polynomial Hirsch Conjecture
- CS-715 Defining High-Dimensional Expanders Through Local Spectra
- CS-716 Explicit Equations Separating Matrix Multiplication from Low-Rank Tensors
- CS-717 Sequential Decoding of Nonbinary Convolutional Codes
- CS-718 Convolutional Codes for Retrieval, Sensing, and Rank Metrics
- CS-719 Restricted Models of Vertex-Distribution-Free Testing
- CS-720 Automatic Recognition of Numerically Unstable Quadratic Programs
- CS-721 Adaptive Refinement and Global Optimization of Topological Shapes
- CS-722 Low-Temperature Sampling by Randomly Initialized Glauber Dynamics
- CS-723 Multiplicity Obstructions in Geometric Complexity Theory
- CS-724 Primal and Dual Geometry of SONC Relaxations
- CS-725 Global Optimality of Domain-Decomposition Transport Algorithms
- CS-726 Robustness-Driven Overparameterization in Two-Layer Neural Networks
- CS-727 Geometric Analogues of Finite Effective Complexity
- CS-728 Comparative Advantages of Physics-Based and Machine-Learned Models
- CS-729 High-Dimensional Regression and PDE Learning Without Dimensional Curse
- CS-730 Algorithms for Symmetry-Reduced Semidefinite Programs
- CS-731 Quantum Complexity of High-Precision Matrix Scaling
- CS-732 Unspecified Combinatorial Optimization Problem
- CS-733 Half-Integral Extreme Points for Feedback Vertex Set
- CS-734 Approximating Submodular Functions by Matroid Rank Functions
- CS-735 Probabilistic Box Models
- CS-736 Dimension–Complexity Tradeoffs in Quantum-Function Testing
- CS-737 Average-Case Metacomplexity Characterizations of One-Way Functions
- CS-738 Size-Efficient Circuits Resilient to Short-Circuit Errors
- CS-739 Rank Dependence of Sample Complexity in Matrix Sensing
- CS-740 Computable Neural-Network Approximation from Noisy Samples
- CS-741 Computable Ground Truths for Learning Problems
- CS-742 Stochasticity and Sample Complexity in Neural Networks
- CS-743 Open Problems in Local Graph Complexity
- CS-744 Constraint-Satisfaction Table Caption
- CS-745 Reduction of Guessing Problems to Source Compression
- CS-746 Universal Compression with Large Unknown Alphabets
- CS-747 Mutual-Information Bounds and Dimension-Free Dual Sudakov Minoration
- CS-748 Unspecified Conic Optimization Research Problem
- CS-749 Unspecified Flag Algebra Extremal Problem
- CS-750 Condition-Number-Robust Low-Rank Matrix Completion