Abstract
We prove Toda's Theorem, i.e. PHcc ?deg; BP • ?Pcc ?deg; Pcc(#Pcc) = Pcc(PPcc) , in the context of structural communication complexity. The class PSPACEcc was defined via alternating protocols with O(log n) many alternations. In this article we consider the class BP•?Pcc of Toda's Theorem, and show that every language in this class can be decided with alternating protocols using 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 O(log n/ log log n) many alternations. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Wunderlich, H. (2009). On toda’s theorem in structural communication complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5404 LNCS, pp. 609–620). https://doi.org/10.1007/978-3-540-95891-8_54
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
