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-601 Collision-safe assembly of legacy worksheets
- CS-602 A versioned capability contract for PreTeXt programming languages
- CS-603 Task portability for heterogeneous embeddables
- CS-604 A semantic degradation contract and state lower bound for EPUB knowl fallbacks
- CS-605 Certifying offline PreTeXt slides on removable media
- CS-606 Coherent publication of a course slide collection
- CS-607 A deterministic contract for parallel Macaulay2 core routines
- CS-608 Certified portfolios for a responsive Macaulay2 top level
- CS-609 A degree-slice fast path for basis
- CS-610 Certified degree windows for truncated algebra commands
- CS-611 A versioned contract for reproducible Macaulay2 family benchmarks
- CS-612 Simplicial resolutions in Macaulay2 and a join-complete verification contract
- CS-613 Truncation representatives, semantic equality certificates, and functorial cohomology maps
- CS-614 A consent-bounded two-channel and four-lane community response to harassment
- CS-615 A gated equity-action registry for mathematics organizations
- CS-616 A provenance-bounded design for the history of women in combinatorics
- CS-617 Locally governed translation-before-transfer for non-US departmental equity conversations
- CS-618 An event access assurance case for mathematics
- CS-619 A mobility-and-care adjusted compensation and incidence framework
- CS-620 A co-governed category-and-access charter beyond a single gender binary
- CS-621 A choice-point audit for social framing in mathematical practice
- CS-622 Breach-centered sampling of IBL classroom culture
- CS-623 Identification and repair of an AB/BA proof-learning study
- CS-624 A causal design for long-term effects of Modified Moore Method instruction on baseline-strong students
- CS-625 Optimization with Inexact Real-Valued Inputs
- CS-626 Duplicate Planar Min-Bisection and Bicriteria Extraction
- CS-627 Duplicate Bicriteria Spanning-Tree Enumeration
- CS-628 Fourier Reconstruction of Discrete Objects
- CS-629 Semaev's Auxiliary Elliptic-Curve Index-Calculus Algorithm
- CS-630 Robust Radio-Network Planning Under Traffic Misspecification
- CS-631 Prox-Regularity of Polynomial Stability Abscissas
- CS-632 Sharper Complexity Bounds for Full-Newton Interior-Point Methods
- CS-633 Intrinsic Nonlinear Model Reduction
- CS-634 Interpolation-Point Selection in Rational Krylov Reduction
- CS-635 Observability for Polynomial Systems
- CS-636 Threshold-Avoiding Control for Bank Capital Ratios
- CS-637 Redundant Extraction — Bank Capital-Ratio Control
- CS-638 Application-Independent Parallel Algorithms for Directed Grid Dependencies
- CS-639 Hardness of Decoding Random Linear Codes
- CS-640 Rhetorical Quantum-State Vector-Length Question
- CS-641 Exponential Tree Size of Cluster States
- CS-642 Resolved Triple-Product Group Challenge
- CS-643 Space-Efficient Lattice-Basis Reduction
- CS-644 Practical Strength of Lift-and-Project Relaxations
- CS-645 Integrality-Gap Reduction by Lift-and-Project Closures
- CS-646 Higher-Row Cuts from Cylindrical Simplices
- CS-647 Symmetry-Aware Rank-One Convex Interpolation Algorithms
- CS-648 Runtime Thresholds for Ant-Colony Optimization
- CS-649 Tangency Handling in Telea Image Inpainting
- CS-650 Computational Complexity of Bruhat-Interval Invariants