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-751 Neural Network Robustness under Adversarial and Distribution Shifts
- CS-752 Optimal Worst-Case Estimators for Signal Reconstruction
- CS-753 Unique Genome Reconstruction from Seven Beads
- CS-754 Enumeration and Sparsity of Growing-$k$ SAT Functions
- CS-755 Stable Algorithms and Overlap Gaps for Friendly Bisections
- CS-756 Reconstruction of Chromosome Structure from Contact Maps
- CS-757 Mathematical Conjecture Generation with Machine Intelligence
- CS-758 Interoperable Virtual Laboratories for Scientific Simulation
- CS-759 Training-Loss Implications for Shallow Neural Networks
- CS-760 Convergence to Implicit Geometry under Class Imbalance
- CS-761 Neural Approximation of Strongly Convex Drifts with Linear Error
- CS-762 Open Problems in Proof and Computational Complexity
- CS-763 Coefficient Compression and Structured Proof-System Lower Bounds
- CS-764 Average-Case Complexity of Clique on Sparse Graphs
- CS-765 Spreadness as a Replacement for Sunflower Structure
- CS-766 Restriction Condensation of Deterministic Communication Complexity
- CS-767 Lower Bounds for Polynomial Calculus with Inverses
- CS-768 Expressivity and Training Theory for Deep Material Networks
- CS-769 Hedge-Supermartingale Exposition
- CS-770 Quantum Harmonic Analysis of Data Structure
- CS-771 Learning Data Manifolds for Augmentation and Nonlinear Components
- CS-772 Mixing of Random Colorings on General Graphs
- CS-773 Abelian Embeddings and Gap-CSP Integrality Gaps
- CS-774 Output Length and Error of Seedless Extractors
- CS-775 Autoencoder Optimization Perspectives
- CS-776 Optimal Noiseless Rates for Max-Average-Margin Classifiers
- CS-777 Efficient Computation of Exceptional Galois Representations
- CS-778 Sensor-Actuator Co-Design and Distributed Controllability Algorithms
- CS-779 Neural Networks for High-Dimensional Optimal Feedback Control
- CS-780 Duplicate Strongly Polynomial Linear-Programming Lead-In
- CS-781 Workshop Contents Listing for Combinatorial Optimization
- CS-782 Finite Strategies in the Distance Game
- CS-783 Duplicate Finite-Strategy Question for the Distance Game
- CS-784 Duplicate Fare-Zone Approximation Question
- CS-785 Two-Coloring Light Tournaments
- CS-786 Duplicate Light-Tournament Two-Coloring Question
- CS-787 Half-Integral Extreme Points for a Feedback-Vertex-Set Relaxation
- CS-788 Duplicate Fiorini Feedback-Vertex-Set Question
- CS-789 Generalization Guarantees for Self-Supervised Representations
- CS-790 Adam Optimization Performance
- CS-791 Definition of a Causal Representation
- CS-792 Criteria for a Good Representation
- CS-793 Minimal Assumptions for Additive Randomized Encodings
- CS-794 Power of Shared Randomness in Distributed Computation
- CS-795 Duplicate Distribution-Verification Question
- CS-796 Evasive-LWE Research-Direction Discussion
- CS-797 Cryptographic Equivalences for High-Energy Phenomena
- CS-798 Decidability of Symmetric Polynomial Nonnegativity
- CS-799 Generic Point Identification from Polynomial Measurements
- CS-800 Inverse-Polynomial Influence Thresholds on the Boolean Cube