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-651 Semialgebraic Homeomorphism Types at Fixed Complexity
- CS-652 Boolean Evaluation and Arithmetic-Circuit Complexity
- CS-653 Antisymmetric Association Schemes and Polynomial Factoring
- CS-654 Universal Semantic Communication Across Different Meanings
- CS-655 Fast Instance-Optimal Decoders for Compressed Sensing
- CS-656 Learning Capacity of Totally Geodesic Map Families
- CS-657 Faster Rank-Two Parametric Assignment
- CS-658 Capacity-Preserving Conversion to Unsplittable Flows
- CS-659 Reliable Model Reduction for Nonlinear Parameterized Systems
- CS-660 Expansion-Point Selection in Time-Domain Model Reduction
- CS-661 State Recovery from Quantized Nonlinear Trajectories
- CS-662 Connectivity Reconstruction in Large Neuronal Networks
- CS-663 Polymorphism Characterization of Constraint Approximation Thresholds
- CS-664 Explicit Deterministic Restricted Isometry Matrices
- CS-665 Sample Complexity of Active Coordinate Identification
- CS-666 Fundamental-Domain Choice in Symmetric Integer Programming
- CS-667 General Effectiveness of Symmetry-Aware Polyhedral Pivoting
- CS-668 Polyhedral Information Derived from Known Symmetries
- CS-669 Fast Solvers for the Electronic Schrödinger Equation
- CS-670 Low-Rank Subexponential Electronic-Structure Algorithms
- CS-671 Predicting SAT-Solver Hardness from Formula Structure
- CS-672 Composite Repetition of Three Matroid Questions
- CS-673 Competitiveness of High-Order Hybridizable DG Wave Methods
- CS-674 Differential-Privacy Workshop Framing
- CS-675 Useful Differential-Privacy Framing
- CS-676 Private-Data-Analysis Framing
- CS-677 Polynomial Freiman–Ruzsa Conjecture over Binary Vector Spaces
- CS-678 Machine-Learning Algorithms Results Report
- CS-679 Cryptographic Replacement of Pseudorandom Steganographic Functions
- CS-680 Interior Maximizers of Mixed Characteristic Polynomials
- CS-681 Robust Spectral Tensor Methods for Latent-Variable Learning
- CS-682 Hardness Amplification by Exponent Noise
- CS-683 Optimal Fair Multiparty Coin Flipping
- CS-684 Depth-Independent Attribute-Based Encryption
- CS-685 Complexity of Extremality Testing in Infinite Group Problems
- CS-686 Combinatorial Decompositions of the All-Ones Vector
- CS-687 Dimension Gaps in Lattice Reductions to Learning with Errors
- CS-688 Open Problems in Mixed-Integer Nonlinear Optimization
- CS-689 Convexification and Complexity in Mixed-Integer Optimization
- CS-690 Unspecified Convex-Hull Conjecture for a Pooling Relaxation
- CS-691 Numerical Simulation of Dislocation Polygonization
- CS-692 Karchmer–Raz–Wigderson Formula Lower-Bound Conjecture
- CS-693 Limits of False Discovery Control in Interactive Analysis
- CS-694 Refutation Lower Bounds for Random k-SAT Instances
- CS-695 Depth-Three Lower Bounds for an Explicit Trilinear Function
- CS-696 Applications of Noncommutative F5 Gröbner Bases
- CS-697 Subexponential Completeness Testing for Voronoi Cell Representatives
- CS-698 Discrete Vector Fields for Voronoi-Cohomology Computations
- CS-699 Error-Free Multiparty Homomorphic Secret Sharing
- CS-700 Achievable Relations in Multi-Key Ciphertext Transformations