Electronic Colloquium on Computational Complexity
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
- SIAM J. Comput.
- 2012
We prove an optimal Ω(n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem… (More)
Is this relevant?
1997
1997
- Universität Trier, Mathematik/Informatik…
- 1997
The Electronic Colloquium on Computational Complexity ECCC is a digital library that speci cally addresses the current prob lem… (More)
Is this relevant?
1995
1995
- 1995
In this paper we study the pairs (U; V) of disjoint NP-sets rep-resentable in a theory T of Bounded Arithmetic in the sense that… (More)
Is this relevant?
1995
1995
- 1995
The model of span programs is a linear algebraic model of computation. Lower bounds for span programs imply lower bounds for… (More)
Is this relevant?
1994
1994
- 1994
This paper concerns the open problem of Lovasz and Saks regarding the relationship between the communication complexity of a… (More)
Is this relevant?
1994
1994
- 1994
We introduce the notion of natural proof. We argue that the known proofs of lower bounds on the complexity of explicit Boolean… (More)
Is this relevant?
Review
1994
Review
1994
- 1994
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade… (More)
Is this relevant?
1994
1994
- 1994
We consider the fault diagnosis problem: how to use parallel testing rounds to identify which processors in a set are faulty. We… (More)
Is this relevant?
1994
1994
- 1994
We introduce a population genetics model in which the operators are eeectively computable { computable in polynomial time on… (More)
Is this relevant?
1994
1994
- 1994
The Tutte-Grr othendieck polynomial T(G; x; y) of a graph G encodes numerous interesting combinatorial quantities associated with… (More)
Is this relevant?