🔮
🔮
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
The Tandem Duplication Distance Problem is hard over bounded alphabets
🔮
🔮
The Ethereal
$λ_\infty$ & Maximum Variance Embedding: Measuring and Optimizing Connectivity of A Graph Metric
🔮
🔮
The Ethereal
Two Player Hidden Pointer Chasing and Multi-Pass Lower Bounds in Turnstile Streams
🔮
🔮
The Ethereal
Coarse-Grained Complexity for Dynamic Algorithms
🔮
🔮
The Ethereal
A Formal Axiomatization of Computation
🔮
🔮
The Ethereal
On Asymmetric Unification for the Theory of XOR with a Homomorphism
🔮
🔮
The Ethereal
Constructive derandomization of query algorithms
🔮
🔮
The Ethereal
Inapproximability of Additive Weak Contraction under SSEH and Strong UGC
🔮
🔮
The Ethereal
Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
🔮
🔮
The Ethereal
Regular resolution for CNFs with almost bounded one-sided treewidth
🔮
🔮
The Ethereal
On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims
🔮
🔮
The Ethereal
On Solving Reachability in Grid Digraphs using a Psuedoseparator
🔮
🔮
The Ethereal
The Weak Call-By-Value λ-Calculus is Reasonable for Both Time and Space
🔮
🔮
The Ethereal
Chaitin's Omega and an Algorithmic Phase Transition
🔮
🔮
The Ethereal
On a conditional inequality in Kolmogorov complexity and its applications in communication complexity
🔮
🔮
The Ethereal
Finding dissimilar explanations in Bayesian networks: Complexity results
🔮
🔮
The Ethereal
Expressing Linear Orders Requires Exponential-Size DNNFs
🔮
🔮
The Ethereal
On the Maximum Distance Sublattice Problem and Closest Vector Problem
🔮
🔮
The Ethereal
A Note on Clustering Aggregation for Binary Clusterings
🔮
🔮
The Ethereal
Trading information complexity for error II: the case of a large error and external information complexity
🔮
🔮
The Ethereal
Proceedings of the 9th International Workshop on Physics and Computation
🔮
🔮
The Ethereal
Symmetry and Algorithmic Complexity of Polyominoes and Polyhedral Graphs
🔮
🔮
The Ethereal