Information and coding theory
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.
58 records · Search and filter
- CS-745 Reduction of Guessing Problems to Source Compression
- CS-746 Universal Compression with Large Unknown Alphabets
- CS-747 Mutual-Information Bounds and Dimension-Free Dual Sudakov Minoration
- CS-766 Restriction Condensation of Deterministic Communication Complexity
- CS-774 Output Length and Error of Seedless Extractors
- CS-793 Minimal Assumptions for Additive Randomized Encodings
- CS-809 Griesmer Bounds and Solomon–Stiffler Constructions in Other Metrics
- CS-810 Iterative Quantum LDPC Constructions from Weaker Seeds