🔮
🔮
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
Efficiently Batching Unambiguous Interactive Proofs
🔮
🔮
The Ethereal
Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking
🔮
🔮
The Ethereal
Simulating Evolvability as a Learning Algorithm: Empirical Investigations on Distribution Sensitivity, Robustness, and Constraint Tradeoffs
🔮
🔮
The Ethereal
Nearest Neighbor Representations of Neural Circuits
🔮
🔮
The Ethereal
Graded Projection Recursion (GPR): A Framework for Controlling Bit-Complexity of Algebraic Packing
🔮
🔮
The Ethereal
Halfspaces are hard to test with relative error
🔮
🔮
The Ethereal
Efficient Testing Implies Structured Symmetry
🔮
🔮
The Ethereal
Unbounded-width CSPs are Untestable in a Sublinear Number of Queries
🔮
🔮
The Ethereal
Tensor decomposition beyond uniqueness, with an application to the minrank problem
🔮
🔮
The Ethereal
Most Juntas Saturate the Hardcore Lemma
🔮
🔮
The Ethereal
Relative-error unateness testing
🔮
🔮
The Ethereal
Undirected Multicast Network Coding Gaps via Locally Decodable Codes
🔮
🔮
The Ethereal
Unifying the Landscape of Super-Logarithmic Dynamic Cell-Probe Lower Bounds
🔮
🔮
The Ethereal
PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization
🔮
🔮
The Ethereal
Nine lower bound conjectures on streaming approximation algorithms for CSPs
🔮
🔮
The Ethereal
k-SUM Hardness Implies Treewidth-SETH
🔮
🔮
The Ethereal
The Computational Complexity of Almost Stable Clustering with Penalties
🔮
🔮
The Ethereal
Hardness and Algorithmic Results for Roman \{3\}-Domination
🔮
🔮
The Ethereal
Efficient Turing Machine Simulation with Transformers
🔮
🔮
The Ethereal
The Complexity of Finding and Counting Subtournaments
🔮
🔮
The Ethereal
Smaller Circuits for Bit Addition
🔮
🔮
The Ethereal
Lower Bounds for Linear Operators
🔮
🔮
The Ethereal