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-801 Dimension-Free Sum-of-Squares Certificates for Two Quadratic Constraints
- CS-802 Duplicate Dimension-Free Separation-Exponent Problem
- CS-803 Quotients and Presentations of L-Convex Objects
- CS-804 Improvements to the Signed Heat Method
- CS-805 Ensemble Necessity in Data Assimilation
- CS-806 Joint Design of Bridging Schedules and Transport Maps
- CS-807 Efficient Optimization of Neural-Network Weights
- CS-808 Reported Quantum Search for Binary Fusion Data
- CS-809 Griesmer Bounds and Solomon–Stiffler Constructions in Other Metrics
- CS-810 Iterative Quantum LDPC Constructions from Weaker Seeds
- CS-811 Formal Verification of AI-Generated Mathematical Proofs
- CS-812 Generative Sphere Packing across Dimensions and Periodic Geometries
- CS-813 Agentic and Neuro-Symbolic AI for Mathematical Research
- CS-814 Scaling Paradigms for Lean Autoformalization
- CS-815 Causal-Attention Retrieval Motivation
- CS-816 Convergence of Accelerated Sampling on Probability Spaces
- CS-817 Complexity and Generalization in Overparameterized Learning
- CS-818 Unified Mathematical Theory of Modern Learning
- CS-819 Curricula for Algorithmic Reasoning in Sequence Models
- CS-820 Inference and Training Effects of the Softmax Bottleneck
- CS-821 Extremal Top-$m$ Representability of Output Projection Matrices
- CS-822 Human Alignment of Artificial Intelligence Systems
- CS-823 Duplicate Human-Alignment Question
- CS-824 New Theoretical Principles for Foundation Models
- CS-825 Duplicate Unified-Theory Question
- CS-826 Polynomial-time solution of rational P-matrix linear complementarity
- CS-827 Realistic equilibrium adjustment
- CS-828 Scalable heterogeneous-agent macroeconomics
- CS-829 The computational cost of minimax-optimal causal estimation
- CS-830 Exact complexity of Hylland--Zeckhauser allocation
- CS-831 Exact complexity of an Arrow--Debreu equilibrium
- CS-832 A combinatorial polynomial-time nucleolus algorithm for matching games
- CS-833 A polynomial-time approximation scheme for bimatrix Nash equilibrium
- CS-834 Computational complexity of optimin in finite games
- CS-835 High-precision information-value-free coarse correlated equilibrium
- CS-836 Exact normal-form correlated equilibrium from an extensive-form tree
- CS-837 Expected-polynomial exact Nash computation for random rational games
- CS-838 Extending descent-and-mixing methods to a fixed number of players
- CS-839 Strong approximation of Nash equilibria in concise potential games
- CS-840 Exact Nash complexity in concisely represented potential games
- CS-841 Improving search-and-mix approximation guarantees
- CS-842 Statistical confidence in game equilibria
- CS-843 Reduced-game validity
- CS-844 Critical Bernoulli densities for expected-polynomial Nash computation
- CS-845 Average-case analysis of specified search-and-mix algorithms
- CS-846 Structural classes with polynomial-time exact bimatrix Nash computation
- CS-847 Exact Nash computation in extensive-form games: resolved classification
- CS-848 Threshold Nash equilibrium in extensive form: resolved classification
- CS-849 Characterizing universal convergence of fictitious play
- CS-850 Payoff characterization of convergence for a fixed mirror-descent rule