Complexity and structure
NP is as easy as detecting unique solutions
Theoretical Computer Science
Probalisitic complexity classes and lowness
Journal of Computer and System Sciences
Structural complexity 2
Relations between communication complexity classes
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
Communication complexity
Complexity theory retrospective II
Complexity theory retrospective II
Complexity theory retrospective II
Two remarks on the power of counting
Proceedings of the 6th GI-Conference on Theoretical Computer Science
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On relations between counting communication complexity classes
Journal of Computer and System Sciences
On Computation and Communication with Small Bias
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We prove Toda's Theorem, i.e. in the context of structural communication complexity. The class PSPACE cc was defined via alternating protocols with $\mathcal{O}(\log n)$ many alternations. In this article we consider the class BP· ⊕ P cc of Toda’s Theorem, and show that every language in this class can be decided with alternating protocols using $\mathcal{O}(\log n/\log\log n)$ many alternations. The respective proof is based on a new alternating protocol for the inner product function IP with $\mathcal{O}(\log n/\log\log n)$ many alternations.