🔮
🔮
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
The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable
🔮
🔮
The Ethereal
On the hardness of learning sparse parities
🔮
🔮
The Ethereal
Near-Optimal UGC-hardness of Approximating Max k-CSP_R
🔮
🔮
The Ethereal
Complexity and Approximability of Parameterized MAX-CSPs
🔮
🔮
The Ethereal
Polynomial Factorization over Finite Fields By Computing Euler-Poincare Characteristics of Drinfeld Modules
🔮
🔮
The Ethereal
Bipartite Matching is in Catalytic Logspace
🔮
🔮
The Ethereal
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
🔮
🔮
The Ethereal
Treewidth Inapproximability and Tight ETH Lower Bound
🔮
🔮
The Ethereal
Locality Bounds for Sampling Hamming Slices
🔮
🔮
The Ethereal
Detecting Low-Degree Truncation
🔮
🔮
The Ethereal
On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
🔮
🔮
The Ethereal
On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results
🔮
🔮
The Ethereal
Tight approximability of MAX 2-SAT and relatives, under UGC
🔮
🔮
The Ethereal
Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas
🔮
🔮
The Ethereal
On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications
🔮
🔮
The Ethereal
Streaming Lower Bounds and Asymmetric Set-Disjointness
🔮
🔮
The Ethereal
Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG
🔮
🔮
The Ethereal
On the Complexity of CSP-based Ideal Membership Problems
🔮
🔮
The Ethereal
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree
🔮
🔮
The Ethereal
Efficient Circuit Simulation in MapReduce
🔮
🔮
The Ethereal
On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models
🔮
🔮
The Ethereal
Enumerating models of DNF faster: breaking the dependency on the formula size
🔮
🔮
The Ethereal