🔮
🔮
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
From Weak to Strong LP Gaps for all CSPs
🔮
🔮
The Ethereal
On the Implicit Graph Conjecture
🔮
🔮
The Ethereal
Dual-normal Logic Programs - the Forgotten Class
🔮
🔮
The Ethereal
Quantum Oracle Classification - The Case of Group Structure
🔮
🔮
The Ethereal
New Deterministic Algorithms for Solving Parity Games
🔮
🔮
The Ethereal
Communication with Contextual Uncertainty
🔮
🔮
The Ethereal
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!
🔮
🔮
The Ethereal
Hardness of Maximum Likelihood Learning of DPPs
🔮
🔮
The Ethereal
Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
🔮
🔮
The Ethereal
On the Power of Interactive Proofs for Learning
🔮
🔮
The Ethereal
The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
🔮
🔮
The Ethereal
The Primal Pathwidth SETH
🔮
🔮
The Ethereal
Alphabet Reduction for Reconfiguration Problems
🔮
🔮
The Ethereal
On the Constant-Depth Circuit Complexity of Generating Quasigroups
🔮
🔮
The Ethereal
Deterministic 3SUM-Hardness
🔮
🔮
The Ethereal
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold
🔮
🔮
The Ethereal
Approximate Model Counting: Is SAT Oracle More Powerful than NP Oracle?
🔮
🔮
The Ethereal
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
🔮
🔮
The Ethereal
The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability
🔮
🔮
The Ethereal
Dynamic Toolbox for ETRINV
🔮
🔮
The Ethereal
Improved (In-)Approximability Bounds for d-Scattered Set
🔮
🔮
The Ethereal
Approximating the Orthogonality Dimension of Graphs and Hypergraphs
🔮
🔮
The Ethereal