Electronic Colloquium on Computational Complexity (ECCC) - researchr journal

researchr

You are not signed in
Sign in
Sign up

Itai Benjamini, Oded Schramm, Asaf Shapira. Every Minor-Closed Property of Sparse Graphs is Testable. Electronic Colloquium on Computational Complexity (ECCC), 15(010), 2008.
Chris Calabro. A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths. Electronic Colloquium on Computational Complexity (ECCC), 15(110), 2008.
Arnab Bhattacharyya. A Note on the Distance to Monotonicity of Boolean Functions. Electronic Colloquium on Computational Complexity (ECCC), 15(012), 2008.
Lior Malka. Instance-Dependent Commitment Schemes and the Round Complexity of Perfect Zero-Knowledge Proofs. Electronic Colloquium on Computational Complexity (ECCC), 15(068), 2008.
Sanjeeb Dash. On the complexity of cutting plane proofs using split cuts. Electronic Colloquium on Computational Complexity (ECCC), 15(084), 2008.
Felix Brandt, Felix A. Fischer, Markus Holzer. On Iterated Dominance, Matrix Elimination, and Matched Paths. Electronic Colloquium on Computational Complexity (ECCC), 15(077), 2008.
Stasys Jukna. Entropy of operators or why matrix multiplication is hard for small depth circuits. Electronic Colloquium on Computational Complexity (ECCC), 15(019), 2008.
Luca Trevisan, Madhur Tulsiani, Salil P. Vadhan. Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution. Electronic Colloquium on Computational Complexity (ECCC), 15(103), 2008.
Venkatesan Guruswami, Prasad Raghavendra. Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness. Electronic Colloquium on Computational Complexity (ECCC), 15(008), 2008.
Meena Mahajan, B. V. Raghavendra Rao. Arithmetic circuits, syntactic multilinearity, and the limitations of skew formulae. Electronic Colloquium on Computational Complexity (ECCC), 15(048), 2008.