🏛️ 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
🔮
🔮
The Ethereal
On the algebraic proof complexity of Tensor Isomorphism
🔮
🔮
The Ethereal
Can You Solve Closest String Faster than Exhaustive Search?
🔮
🔮
The Ethereal
Nonlinear Random Matrices and Applications to the Sum of Squares Hierarchy
🔮
🔮
The Ethereal
Sleptsov Nets are Turing-complete
🔮
🔮
The Ethereal
Secret Sharing on Superconcentrator
🔮
🔮
The Ethereal
Separation Results for Boolean Function Classes
🔮
🔮
The Ethereal
On the relation between structured $d$-DNNFs and SDDs
🔮
🔮
The Ethereal
A 2-approximation for the $k$-prize-collecting Steiner tree problem
🔮
🔮
The Ethereal
Inapproximability Results for Scheduling with Interval and Resource Restrictions
🔮
🔮
The Ethereal
The directed 2-linkage problem with length constraints
🔮
🔮
The Ethereal
Lasserre Integrality Gaps for Graph Spanners and Related Problems
🔮
🔮
The Ethereal
Pointers in Recursion: Exploring the Tropics
🔮
🔮
The Ethereal
Vector Colorings of Random, Ramanujan, and Large-Girth Irregular Graphs
🔮
🔮
The Ethereal
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
🔮
🔮
The Ethereal
Tight Euler tours in uniform hypergraphs - computational aspects
🔮
🔮
The Ethereal
Optimal lower bounds for universal relation, samplers, and finding duplicates
🔮
🔮
The Ethereal
A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem
🔮
🔮
The Ethereal
Generation, Ranking and Unranking of Ordered Trees with Degree Bounds
🔮
🔮
The Ethereal
The computational complexity of calculating partition functions of optimal medians with Hamming distance
🔮
🔮
The Ethereal
On approximating tree spanners that are breadth first search trees
🔮
🔮
The Ethereal
Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most Three
🔮
🔮
The Ethereal
Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound
🔮
🔮
The Ethereal