The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach

The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach

We present a survey of the communication point of view for a complexity lower bounds proof technique for classical (deterministic, nondeterministic and randomized) and quantum models of branching programs.

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Ablayev, Farid
Format: Buchkapitel
Sprache:eng
Schlagworte:
Branching programs
communication computations
quantum computations
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a survey of the communication point of view for a complexity lower bounds proof technique for classical (deterministic, nondeterministic and randomized) and quantum models of branching programs.
ISSN:0302-9743
1611-3349
DOI:10.1007/11571155_16