🔮
🔮
The Ethereal
🏛️ 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
Some Results on Approximability of Minimum Sum Vertex Cover
🔮
🔮
The Ethereal
On the complexity of symmetric vs. functional PCSPs
🔮
🔮
The Ethereal
Tensor Reconstruction Beyond Constant Rank
🔮
🔮
The Ethereal
Is the Algorithmic Kadison-Singer Problem Hard?
🔮
🔮
The Ethereal
1-Extendability of independent sets
🔮
🔮
The Ethereal
Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets
🔮
🔮
The Ethereal
Globally Minimal Defensive Alliances: A Parameterized Perspective
🔮
🔮
The Ethereal
Nearest Neighbor Representations of Neurons
🔮
🔮
The Ethereal
Mim-Width is paraNP-complete
🔮
🔮
The Ethereal
Near-Optimal Averaging Samplers and Matrix Samplers
🔮
🔮
The Ethereal
Better Boosting of Communication Oracles, or Not
🔮
🔮
The Ethereal
The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
🔮
🔮
The Ethereal
Superconstant Inapproximability of Decision Tree Learning
🔮
🔮
The Ethereal
A New Information Complexity Measure for Multi-pass Streaming with Applications
🔮
🔮
The Ethereal
Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
🔮
🔮
The Ethereal
An exposition of recent list-size bounds of FRS Codes
🔮
🔮
The Ethereal
Testing Intersecting and Union-Closed Families
🔮
🔮
The Ethereal
Enumeration and updates for conjunctive linear algebra queries through expressibility
🔮
🔮
The Ethereal
A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers
🔮
🔮
The Ethereal
Preprocessing Complexity for Some Graph Problems Parameterized by Structural Parameters
🔮
🔮
The Ethereal
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results
🔮
🔮
The Ethereal
Solving Unique Games over Globally Hypercontractive Graphs
🔮
🔮
The Ethereal