🔮
🔮
The Ethereal
🏛️ The Computational Complexity Crypt
cs.CC: Where Computational Complexity papers rest without their code.
841
Total Papers
0
No Code
809
Twilight
32
Has Code
3.8%
Survival Rate
🔮
🔮
The Ethereal
A Converse to Banach's Fixed Point Theorem and its CLS Completeness
🔮
🔮
The Ethereal
Algorithmic statistics: forty years later
🔮
🔮
The Ethereal
Fast Parallel Fixed-Parameter Algorithms via Color Coding
🔮
🔮
The Ethereal
Range Avoidance for Constant-Depth Circuits: Hardness and Algorithms
🔮
🔮
The Ethereal
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation
🔮
🔮
The Ethereal
Fine-grained hardness of CVP(P) -- Everything that we can prove (and nothing else)
🔮
🔮
The Ethereal
Computational Complexity of Motion Planning of a Robot through Simple Gadgets
🔮
🔮
The Ethereal
How hard is it to satisfy (almost) all roommates?
🔮
🔮
The Ethereal
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
🔮
🔮
The Ethereal
Counting Subgraphs in Degenerate Graphs
🔮
🔮
The Ethereal
Reconstructing Trees from Traces
🔮
🔮
The Ethereal
Low-Rank Matrix Approximation in the Infinity Norm
🔮
🔮
The Ethereal
Dichotomy for Digraph Homomorphism Problems
🔮
🔮
The Ethereal
Canonizing Graphs of Bounded Tree Width in Logspace
🔮
🔮
The Ethereal
The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity
🔮
🔮
The Ethereal
The Strongish Planted Clique Hypothesis and Its Consequences
🔮
🔮
The Ethereal
On Approximability of Clustering Problems Without Candidate Centers
🔮
🔮
The Ethereal
New Techniques for Proving Fine-Grained Average-Case Hardness
🔮
🔮
The Ethereal
Non interactive simulation of correlated distributions is decidable
🔮
🔮
The Ethereal
The Minrank of Random Graphs
🔮
🔮
The Ethereal
Learning sums of powers of low-degree polynomials in the non-degenerate case
🔮
🔮
The Ethereal
Limits on representing Boolean functions by linear combinations of simple functions: thresholds, ReLUs, and low-degree polynomials
🔮
🔮
The Ethereal