🔮
🔮
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
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs
🔮
🔮
The Ethereal
Dichotomy for Real Holant$^c$ Problems
🔮
🔮
The Ethereal
Assessing the Computational Complexity of Multi-Layer Subgraph Detection
🔮
🔮
The Ethereal
On the effect of randomness on planted 3-coloring models
🔮
🔮
The Ethereal
Advice Complexity of the Online Induced Subgraph Problem
🔮
🔮
The Ethereal
On the Role of Shared Randomness in Simultaneous Communication
🔮
🔮
The Ethereal
Which arithmetic operations can be performed in constant time in the RAM model with addition?
🔮
🔮
The Ethereal
Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv
🔮
🔮
The Ethereal
Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
🔮
🔮
The Ethereal
Certified Hardness vs. Randomness for Log-Space
🔮
🔮
The Ethereal
On girth and the parameterized complexity of token sliding and token jumping
🔮
🔮
The Ethereal
Structural Decompositions of Epistemic Logic Programs
🔮
🔮
The Ethereal
Correlation decay and partition function zeros: Algorithms and phase transitions
🔮
🔮
The Ethereal
Parameterized Complexity of Conflict-free Graph Coloring
🔮
🔮
The Ethereal
Computing Hitting Set Kernels By AC^0-Circuits
🔮
🔮
The Ethereal
Matrix multiplication algorithms from group orbits
🔮
🔮
The Ethereal
Two-level lot-sizing with inventory bounds
🔮
🔮
The Ethereal
Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations
🔮
🔮
The Ethereal
A stronger connection between the asymptotic rank conjecture and the set cover conjecture
🔮
🔮
The Ethereal
Parameterized inapproximability for Steiner Orientation by Gap Amplification
🔮
🔮
The Ethereal
Tight Sum-of-Squares lower bounds for binary polynomial optimization problems
🔮
🔮
The Ethereal
Fractals for Kernelization Lower Bounds
🔮
🔮
The Ethereal