Algorithms and data structures
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.
91 records · Search and filter
- CS-297 Rotational Matching Complexity for Planar Point Sets
- CS-305 Independence and Density Thresholds for Cuckoo Hashing
- 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-316 Worst-Case Inputs for Smoothed Caching Complexity
- CS-321 Reusable Garbled RAM under Weaker Assumptions
- CS-322 Polynomial-Time Minimization of K-Submodular Functions
- CS-335 Overlap Gaps and Algorithmic Hardness of Submatrix Detection
- CS-337 Complexity of Bray’s Involution-Centralizer Algorithm
- CS-356 Hardness of Root-Dependent Spanning-Tree Optimization
- CS-362 Subquadratic Approximation for Longest Common Subsequences
- CS-376 Complexity of Submodular $k$-Partition
- CS-380 Near-Optimal Algorithms for Mixed-Integer Convex Optimization
- CS-385 Compact Representations of Four-Thirds Near-Mincuts
- CS-387 Deterministic Optimization of Top-$k$ Perfect-Matching Edges
- CS-404 Convex Relaxations for Planted Graph Matching
- CS-413 Algorithms for Amoeba Dimensions from Tropical Fans
- CS-433 Approximating Fare-Zone Assignment on Trees
- CS-446 Universal-Cover Isomorphism Algorithms for Cube Complexes
- CS-459 3.10 (Futer, Schleimer) — A practical 3-manifold homeomorphism algorithm
- CS-515 Length-faithful algebraic and group-theoretic parameter screens for SL_n(F_p) hashing
- CS-627 Duplicate Bicriteria Spanning-Tree Enumeration
- CS-629 Semaev's Auxiliary Elliptic-Curve Index-Calculus Algorithm
- CS-638 Application-Independent Parallel Algorithms for Directed Grid Dependencies
- CS-642 Resolved Triple-Product Group Challenge
- CS-647 Symmetry-Aware Rank-One Convex Interpolation Algorithms
- CS-658 Capacity-Preserving Conversion to Unsplittable Flows
- CS-670 Low-Rank Subexponential Electronic-Structure Algorithms
- CS-677 Polynomial Freiman–Ruzsa Conjecture over Binary Vector Spaces
- CS-678 Machine-Learning Algorithms Results Report
- CS-712 Local Algorithms for Semidefinite Programming
- CS-716 Explicit Equations Separating Matrix Multiplication from Low-Rank Tensors
- CS-725 Global Optimality of Domain-Decomposition Transport Algorithms
- CS-730 Algorithms for Symmetry-Reduced Semidefinite Programs
- CS-734 Approximating Submodular Functions by Matroid Rank Functions
- CS-755 Stable Algorithms and Overlap Gaps for Friendly Bisections
- CS-770 Quantum Harmonic Analysis of Data Structure
- CS-778 Sensor-Actuator Co-Design and Distributed Controllability Algorithms
- CS-784 Duplicate Fare-Zone Approximation Question
- CS-819 Curricula for Algorithmic Reasoning in Sequence Models