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-201 Exact CI rationalization through rational local charts
- CS-202 Componentwise entropy rigidity and a reduced search for a non-multilinear matroid
- CS-203 Gaussian observed-likelihood equations and a rank-certified monotone solution
- CS-204 Finite Markov templates with several varying level sets
- CS-205 Quartic Markov bases and saturated simplicial leaves
- CS-206 A cyclic-slice chart for balanced minimal border rank
- CS-207 Fourier edge invariants and a visibility threshold for finite rate-class mixtures
- CS-208 Simultaneously certified invariant quartet scoring and robust assembly
- CS-209 Root obstruction and outgroup-oriented algebraic clade certificates
- CS-210 A gap-move bound and the exact decomposable-model spectrum
- CS-211 One observable mode can lift to infinitely many hidden-parameter maxima
- CS-212 ML degree, feasibility, and a Gaussian likelihood-root trichotomy
- CS-213 Complex count solved, with an exact real-root cusp slice
- CS-214 Exact Bayesian evidence and prediction for finite latent discrete models
- CS-215 Markov-basis complexity depends on representation
- CS-216 Equality constraints do not characterize hidden-variable models
- CS-217 Parameter tying and exact homogeneous binary-star invariants
- CS-218 Exact output-sensitive scaling for decomposable discrete models
- CS-219 Arbitrary logistic cell gaps with positive margins and ordinary-margin obstructions
- CS-220 Exact chain gluing and a sharp cyclic incompatibility certificate
- CS-221 Explicit Gaussian MLE for monotone block missingness
- CS-222 Nondefectivity and low-degree obstructions for the two-component S4 Birkhoff model
- CS-223 An exact MLE fiber for the smallest binary hidden-variable model
- CS-224 Saturation-aware exceptional likelihood fibers and the 2x2 independence locus
- CS-225 Covariance-whitened polynomial invariants for model goodness of fit
- CS-226 Removing term order without hiding the extrapolation choice
- CS-227 Finite-field least squares as statistical decoding
- CS-228 Cyclic-binomial structure in an early Agrawal conjecture
- CS-229 A norm obstruction for Agrawal's conjecture
- CS-230 Perfect-number recognition and simultaneous polynomial divisors
- CS-231 Adjacent nonisogenous fibers in the Legendre family
- CS-232 Irreducible line sections: exact convention-sensitive counts and monodromy status
- CS-233 Binomial windows for prescribed-degree factors
- CS-234 Information and conditioning audit for zeta-zero primality and factoring proposals
- CS-235 A local-to-global screen for number-field ECM torsion
- CS-236 Geometry, residues, and scale thresholds for prescribed-prefix prime products
- CS-237 A nonresidue-to-witness reduction and exact witness count
- CS-238 Finite certificate interfaces for finite-field zeta functions
- CS-239 Deformation, specialization, and plane-curve genus
- CS-240 Deterministic roots of X^3-2: a density-one-eighteenth residual envelope
- CS-241 Regular-orbit equivalence and affine orbit-size certificates for SDLP
- CS-242 A stabilizer-aware query barrier for vectorization lower bounds
- CS-243 The inverse-state twist interface, extraction boundary, and exact storage limit
- CS-244 A one-round action barrier and leave-one-out multiparty key routing
- CS-245 Exact rank-one decoding and a factorized no-QRAM quantum baseline
- CS-246 Hidden Goppa presentations versus public-code decoding
- CS-247 Certificates for hidden Goppa structure and bounded decoding
- CS-248 Grover optimality and a tail-profile bound for average-value search
- CS-249 Multiple marked inputs: exclusion bounds and tight query regimes
- CS-250 Finite-window reduction and binary-cost accounting for hidden shift on the integers