🔮
🔮
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
Robust testing of low-dimensional functions
🔮
🔮
The Ethereal
Multistage Graph Problems on a Global Budget
🔮
🔮
The Ethereal
Near-optimal approximation algorithm for simultaneous Max-Cut
🔮
🔮
The Ethereal
On Colouring $(2P_2,H)$-Free and $(P_5,H)$-Free Graphs
🔮
🔮
The Ethereal
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs
🔮
🔮
The Ethereal
On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth
🔮
🔮
The Ethereal
Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique
🔮
🔮
The Ethereal
Quantum-Inspired Perfect Matching under Vertex-Color Constraints
🔮
🔮
The Ethereal
Counting Small Induced Subgraphs: Hardness via Fourier Analysis
🔮
🔮
The Ethereal
Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
🔮
🔮
The Ethereal
Near Optimal Alphabet-Soundness Tradeoff PCPs
🔮
🔮
The Ethereal
A universal sequence of tensors for the asymptotic rank conjecture
🔮
🔮
The Ethereal
The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
🔮
🔮
The Ethereal
Semidefinite programming and linear equations vs. homomorphism problems
🔮
🔮
The Ethereal
Relaxed Local Correctability from Local Testing
🔮
🔮
The Ethereal
On the Hardness of Average-case k-SUM
🔮
🔮
The Ethereal
Fine-Grained Complexity of Regular Expression Pattern Matching and Membership
🔮
🔮
The Ethereal
Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete
🔮
🔮
The Ethereal
Running Time Analysis of the (1+1)-EA for Robust Linear Optimization
🔮
🔮
The Ethereal
Tight Approximation Ratio for Minimum Maximal Matching
🔮
🔮
The Ethereal
Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols
🔮
🔮
The Ethereal
On the Computational Complexity of Length- and Neighborhood-Constrained Path Problems
🔮
🔮
The Ethereal