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-301 Achievable External Behaviors Under Controller Interconnection
- CS-302 Circular Assume–Guarantee Reasoning for General Systems
- CS-303 Optimal Feasible Sets from Quantized Trajectory Observations
- CS-304 Global Observability from Negative Gramian Curvature
- CS-305 Independence and Density Thresholds for Cuckoo Hashing
- CS-306 Sensitivity Growth Under Boolean Conjunctions
- CS-307 Orbit-Closure Obstructions for Permanent–Determinant Separation
- CS-308 Decidability of Universal Factor Languages
- CS-309 Symmetry-Preserving Evaluation of Orbitwise Generating Functions
- CS-310 Integer Carathéodory Property for Intersecting Matroid Base Polytopes
- CS-311 Integer Carathéodory Property for Arborescence Polytopes
- CS-312 Greedy Decomposition of the Spanning-Tree Polytope
- CS-313 Density and Geometry Recovery from Nearest-Neighbor Graphs
- CS-314 Polynomial-Time Algorithms for High-Dimensional Private Queries
- CS-315 Multicolored Sunflower Conjecture over Ternary Vector Spaces
- CS-316 Worst-Case Inputs for Smoothed Caching Complexity
- CS-317 Polynomial Tractability of Permutation-Invariant Integration
- CS-318 Decidability and Finiteness of Rational Joint Spectral Radii
- CS-319 Efficient Moment Relaxations for Polynomial Optimization
- CS-320 Witness Pseudorandom Functions from Witness Encryption
- CS-321 Reusable Garbled RAM under Weaker Assumptions
- CS-322 Polynomial-Time Minimization of K-Submodular Functions
- CS-323 Complexity of Maximizing Initial Odd Ears
- CS-324 Additive Integrality Gap for Ring Loading
- CS-325 Exact Integrality Gap for Capacitated Facility Location
- CS-326 Compact Constant-Gap Relaxations for Capacitated Facility Location
- CS-327 Constructive Selection for Bessel Sequences
- CS-328 Complexity of Embedding Two-Complexes in Three-Manifolds
- CS-329 Complexity and Rank of Completely Positive Matrices
- CS-330 Volume of the Boolean Quadric Polytope
- CS-331 Core Points of Transitive Permutation Groups
- CS-332 Consequences of Indistinguishability Obfuscation
- CS-333 Accurate Answers to Adaptively Chosen Statistical Queries
- CS-334 Randomized Communication Complexity of Distributed Triangle Detection
- CS-335 Overlap Gaps and Algorithmic Hardness of Submatrix Detection
- CS-336 Simultaneously Adaptive Universal Source Coding
- CS-337 Complexity of Bray’s Involution-Centralizer Algorithm
- CS-338 Sublinear Membership Testing in Two-Generator Matrix Groups
- CS-339 Computing Hecke Operators for Arithmetic-Group Cohomology
- CS-340 Security of Interactive Lattice-Based Group Key Exchange
- CS-341 Assumptions and Function Classes for Function Secret Sharing
- CS-342 Round Complexity of Non-Malleable Commitments
- CS-343 Average-Case Hardness of Quasi-Cyclic Code Problems
- CS-344 Sampling Complexity of Hyperbolic-Cross Approximation
- CS-345 Resolution Lower Bounds for Clique Certification
- CS-346 Practical Sum-of-Squares Tensor Completion
- CS-347 Information–Computation Gaps in Sparse Linear Regression
- CS-348 Global Optimization of Overparameterized Shallow Networks
- CS-349 Extrapolating Clusterings from Semidefinite Subsamples
- CS-350 Local Approximation of Random-Graph Semidefinite Programs