On Toda’s Theorem in Structural Communication Complexity
From MaRDI portal
Publication:3599108
DOI10.1007/978-3-540-95891-8_54zbMath1206.68132OpenAlexW1501683169MaRDI QIDQ3599108
Publication date: 3 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:289-vts-69119
Related Items
Cites Work
- Relations between communication complexity classes
- Complexity and structure
- NP is as easy as detecting unique solutions
- Probabilistic complexity classes and lowness
- On relations between counting communication complexity classes
- PP is as Hard as the Polynomial-Time Hierarchy
- Communication Complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item