🔮
🔮
The Ethereal
🏛️ The Computational Complexity Crypt
cs.CC: Where Computational Complexity papers rest without their code.
844
Total Papers
0
No Code
809
Twilight
35
Has Code
4.1%
Survival Rate
🔮
🔮
The Ethereal
Information-theoretic lower bounds for quantum sorting
🔮
🔮
The Ethereal
Longest Common Subsequence on Weighted Sequences
🔮
🔮
The Ethereal
Minimum Reload Cost Graph Factors
🔮
🔮
The Ethereal
Algorithm for $\mathcal{B}$-partitions, parameterized complexity of the matrix determinant and permanent
🔮
🔮
The Ethereal
Polynomial-time Recognition of 4-Steiner Powers
🔮
🔮
The Ethereal
Equivalence between pathbreadth and strong pathbreadth
🔮
🔮
The Ethereal
Complexity of MLDP
🔮
🔮
The Ethereal
Parameterized Orientable Deletion
🔮
🔮
The Ethereal
On the Decision Tree Complexity of String Matching
🔮
🔮
The Ethereal
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem
🔮
🔮
The Ethereal
Plain stopping time and conditional complexities revisited
🔮
🔮
The Ethereal
Distributed compression through the lens of algorithmic information theory: a primer
🔮
🔮
The Ethereal
List approximation for increasing Kolmogorov complexity
🔮
🔮
The Ethereal
NP-hardness of sortedness constraints
🔮
🔮
The Ethereal
Heuristic algorithms for obtaining Polynomial Threshold Functions with low densities
🔮
🔮
The Ethereal
More Efficient $k$-wise Independent Permutations from Random Reversible Circuits via log-Sobolev Inequalities
🔮
🔮
The Ethereal
Hardness Results for Minimizing the Covariance of Randomly Signed Sum of Vectors
🔮
🔮
The Ethereal
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
🔮
🔮
The Ethereal
Rounding via Low Dimensional Embeddings
🔮
🔮
The Ethereal
Complexity of Simon's problem in classical sense
🔮
🔮
The Ethereal
Hardness of Interval Scheduling on Unrelated Machines
🔮
🔮
The Ethereal
Enumerating Connected Dominating Sets
🔮
🔮
The Ethereal