🔮
🔮
The Ethereal
🏛️ The Computational Complexity Crypt
cs.CC: Where Computational Complexity papers rest without their code.
843
Total Papers
0
No Code
809
Twilight
34
Has Code
4.0%
Survival Rate
🔮
🔮
The Ethereal
Improved PIR Schemes using Matching Vectors and Derivatives
🔮
🔮
The Ethereal
Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis
🔮
🔮
The Ethereal
Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits
🔮
🔮
The Ethereal
The Sharp Power Law of Local Search on Expanders
🔮
🔮
The Ethereal
On Solution Discovery via Reconfiguration
🔮
🔮
The Ethereal
Improved Pseudorandom Generators for $\mathsf{AC}^0$ Circuits
🔮
🔮
The Ethereal
Streaming Zero-Knowledge Proofs
🔮
🔮
The Ethereal
Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries
🔮
🔮
The Ethereal
Liar's Domination in Unit Disk Graphs
🔮
🔮
The Ethereal
A Note on the Concrete Hardness of the Shortest Independent Vectors Problem in Lattices
🔮
🔮
The Ethereal
Grundy Coloring & friends, Half-Graphs, Bicliques
🔮
🔮
The Ethereal
Graph Motif Problems Parameterized by Dual
🔮
🔮
The Ethereal
Complexity of fall coloring for restricted graph classes
🔮
🔮
The Ethereal
A Conditional Lower Bound on Graph Connectivity in MapReduce
🔮
🔮
The Ethereal
Fast Commutative Matrix Algorithm
🔮
🔮
The Ethereal
Proportionally dense subgraph of maximum size: complexity and approximation
🔮
🔮
The Ethereal
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
🔮
🔮
The Ethereal
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching
🔮
🔮
The Ethereal
A Lower Bound for Relaxed Locally Decodable Codes
🔮
🔮
The Ethereal
Consistency for 0-1 Programming
🔮
🔮
The Ethereal
The Graph Exploration Problem with Advice
🔮
🔮
The Ethereal
Computational Aspects of Optimal Strategic Network Diffusion
🔮
🔮
The Ethereal