Computer Science catalogue
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.
916 records · Search and filter
- CS-251 A batch-fidelity obstruction in hidden-shift attacks on unique-SVP
- CS-252 Exact period-quotient reduction and unary lift cost for hidden shift on Z^d
- CS-253 Spectral laws for Gaussian multiple-shift states
- CS-254 The cyclic core of Heisenberg hidden shift
- CS-255 The real cost of the CSIDH hidden-shift attack
- CS-256 Exact DDH leakage and sampler criteria for the CSIDH torsor
- CS-257 Finite resource bounds for random spherical covering
- CS-258 HHL, Macaulay conditioning, and presentation instability
- CS-259 Offline Simon, explicit HSP instances, and a classical-transcript obstruction
- CS-260 A localization-safe action of Weyl operators
- CS-261 Degree-windowed Cech computation and the role of one b-function
- CS-262 Fixed-ambient extraction of roots of finite Frobenius modules
- CS-263 Random-access slices of free resolutions
- CS-264 A fixed-basis semibasis certificate for DG-module interoperability
- CS-265 Degree-local Hom computation and certified corner reuse
- CS-266 Expected-Optimum Approximation for Random MAX $R$-3SAT
- CS-267 Approximability and Parameterized Complexity of Steiner Forest
- CS-268 Hardness of the $\varepsilon-Dense$ Steiner Tree Problem
- CS-269 Complexity and Approximation of Planar Min-Bisection
- CS-270 An FPAS for Constrained Bicriteria Spanning Trees
- CS-271 Output-Polynomial Enumeration of Bicriteria Spanning Trees
- CS-272 Polynomial-Time Computation of Ehrhart Periods
- CS-273 Asymptotic Goodness of Function-Field-Tower Codes
- CS-274 Recognition and Eutaxy Testing of Bacher Matrices
- CS-275 Polynomial Complexity of Greedy Lattice Reduction
- CS-276 Central-Trajectory Integral Bounds
- CS-277 Nonadaptive Polynomial Stabilization of Minimum-Phase Linear Systems
- CS-278 Stationary and Optimal Linear Differential Behaviors
- CS-279 Computational Hardness of Learning Parity with Noise
- CS-280 Quantum Hardness of Approximate Lattice Problems
- CS-281 Three-Terminal Distance-Interdiction Complexity
- CS-282 Characterization of Ideal $0$–$1$ Matrices
- CS-283 Integral Primal Certificates for Submodular Minimization
- CS-284 Recognition and Characterization of Leaf Powers
- CS-285 Sampling Algorithms for Maximum-Cut Density
- CS-286 Codegree Thresholds for Hypergraph Matchings
- CS-287 Complexity of Dense Perfect Hypergraph Matching
- CS-288 Separation of Constant-Free Valiant Classes
- CS-289 Optimal Algebraic Immunity of Boolean Functions
- CS-290 Explicit Polynomial Maps Escaping Low-Degree Images
- CS-291 Half-Distance Decoding for Hypergraph Codes
- CS-292 Multiplicity Decoding for Order-Domain Codes
- CS-293 Quantitative Manipulability of Social Choice Functions
- CS-294 Individual Manipulation Power in Neutral Social Choice
- CS-295 Optimal Rates of Collusion-Secure Fingerprinting Codes
- CS-296 Decidability of Simplicial-Complex Embeddability
- CS-297 Rotational Matching Complexity for Planar Point Sets
- CS-298 Convex-Hull Decomposition for Mixed-Integer Bipartite Systems
- CS-299 Alcuin Numbers and Recognition of Small Boat Graphs
- CS-300 Linear Optimization over Mixed-Integer Bipartite Systems