🏛️ 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
🔮
🔮
The Ethereal
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
🔮
🔮
The Ethereal
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
🔮
🔮
The Ethereal
Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV
🔮
🔮
The Ethereal
Strongly refuting all semi-random Boolean CSPs
🔮
🔮
The Ethereal
On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes
🔮
🔮
The Ethereal
Knowledge compilation languages as proof systems
🔮
🔮
The Ethereal
On the Relative Succinctness of Sentential Decision Diagrams
🔮
🔮
The Ethereal
On the Enumeration and Counting of Bicriteria Temporal Paths
🔮
🔮
The Ethereal
Is your function low-dimensional?
🔮
🔮
The Ethereal
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars
🔮
🔮
The Ethereal
Tensor network complexity of multilinear maps
🔮
🔮
The Ethereal
Linear-Time Tree Containment in Phylogenetic Networks
🔮
🔮
The Ethereal
Nonnegative Matrix Factorization Requires Irrationality
🔮
🔮
The Ethereal
Optimality of Correlated Sampling Strategies
🔮
🔮
The Ethereal
Induced Cycles and Paths Are Harder Than You Think
🔮
🔮
The Ethereal
Some easy optimization problems have the overlap-gap property
🔮
🔮
The Ethereal
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
🔮
🔮
The Ethereal
Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source
🔮
🔮
The Ethereal
Integer Programming and Incidence Treedepth
🔮
🔮
The Ethereal
Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders
🔮
🔮
The Ethereal
Expressive power of linear algebra query languages
🔮
🔮
The Ethereal
Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
🔮
🔮
The Ethereal