🔮
🔮
The Ethereal
🏛️ The Computational Complexity Crypt
cs.CC: Where Computational Complexity papers rest without their code.
849
Total Papers
0
No Code
809
Twilight
40
Has Code
4.7%
Survival Rate
🔮
🔮
The Ethereal
On the complexity of constrained reconfiguration and motion planning
🔮
🔮
The Ethereal
NP-Hardness and ETH-Based Inapproximability of Communication Complexity via Relaxed Interlacing
🔮
🔮
The Ethereal
Polynomial-time sampling despite disorder chaos
🔮
🔮
The Ethereal
Asymptotically Optimal Inapproximability of E$k$-SAT Reconfiguration
🔮
🔮
The Ethereal
Treedepth Inapproximability and Exponential ETH Lower Bound
🔮
🔮
The Ethereal
Computational-Statistical Tradeoffs from NP-hardness
🔮
🔮
The Ethereal
Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
🔮
🔮
The Ethereal
Universal Solvability for Robot Motion Planning on Graphs
🔮
🔮
The Ethereal
An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem
🔮
🔮
The Ethereal
Fast Compressed-Domain N-Point Discrete Fourier Transform: The "Twiddless" FFT Algorithm
🔮
🔮
The Ethereal
On optimal distinguishers for Planted Clique
🔮
🔮
The Ethereal
The Planted Orthogonal Vectors Problem
🔮
🔮
The Ethereal
Mind the Gap? Not for SVP Hardness under ETH!
🔮
🔮
The Ethereal
Deciding if a DAG is Interesting is Hard
🔮
🔮
The Ethereal
Semi-Streaming Algorithms for Graph Property Certification
🔮
🔮
The Ethereal
A Quadratic Lower Bound for Stable Roommates Solvability
🔮
🔮
The Ethereal
Parameterized Complexity of (d,r)-Domination via Modular Decomposition
🔮
🔮
The Ethereal
Distance Vector Domination
🔮
🔮
The Ethereal
On the formalization of the notion of a concurrent algorithm
🔮
🔮
The Ethereal
Characterizing and Testing Principal Minor Equivalence of Matrices
🔮
🔮
The Ethereal
Revisiting Tree Canonization using polynomials
🔮
🔮
The Ethereal
Parameterized Shortest Path Reconfiguration
🔮
🔮
The Ethereal