🔮
🔮
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
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
🔮
🔮
The Ethereal
Fast exact algorithms for some connectivity problems parametrized by clique-width
🔮
🔮
The Ethereal
Dimension Reduction for Polynomials over Gaussian Space and Applications
🔮
🔮
The Ethereal
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns
🔮
🔮
The Ethereal
Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One
🔮
🔮
The Ethereal
Slim Tree-Cut Width
🔮
🔮
The Ethereal
Galactic Token Sliding
🔮
🔮
The Ethereal
Modern Hopfield Networks Require Chain-of-Thought to Solve $\mathsf{NC}^1$-Hard Problems
🔮
🔮
The Ethereal
Non-Clashing Teaching Maps for Balls in Graphs
🔮
🔮
The Ethereal
On the cut dimension of a graph
🔮
🔮
The Ethereal
The combined basic LP and affine IP relaxation for promise VCSPs on infinite domains
🔮
🔮
The Ethereal
Equivalence of Systematic Linear Data Structures and Matrix Rigidity
🔮
🔮
The Ethereal
The $k$-Dimensional Weisfeiler-Leman Algorithm
🔮
🔮
The Ethereal
Efficiently factoring polynomials modulo $p^4$
🔮
🔮
The Ethereal
Resolution with Counting: Dag-Like Lower Bounds and Different Moduli
🔮
🔮
The Ethereal
Improving and extending the testing of distributions for shape-restricted properties
🔮
🔮
The Ethereal
A short note on Merlin-Arthur protocols for subset sum
🔮
🔮
The Ethereal
Maximum weighted independent sets with a budget
🔮
🔮
The Ethereal
On the Complexity of Neural Computation in Superposition
🔮
🔮
The Ethereal
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
🔮
🔮
The Ethereal
Solving Projected Model Counting by Utilizing Treewidth and its Limits
🔮
🔮
The Ethereal
Quantum Combinatorial Games: Structures and Computational Complexity
🔮
🔮
The Ethereal