Hochschulschrift
Complexity bounds on some fundamental computational problems for quantum branching programs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
XVIII, 172 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Bonn, Univ., Diss., 2005 (Nicht für den Austausch)
- Klassifikation
-
Informatik
Mathematik
- Schlagwort
-
Quantencomputer
OBDD
Berechnungskomplexität
Untere Schranke
Obere Schranke
Hidden-subgroup-Problem
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:04 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
Complexity bounds on some fundamental computational problems for quantum branching programs
On lower bounds for parity branching programs
Complexity theoretical results for randomized branching programs
Classical simulation complexity of quantum branching programs : (draft)
Incremental branching programs
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
Modified branching programs and their computational power
Classical vs. quantum read once branching programs
Modified branching programs and their computational power
Complexity Bounds for Block-IPs
Probalistic Accuracy Bounds for Perdorated Programs
Probalistic Accuracy Bounds for Perforated Programs
Complexity bounds on some fundamental computational problems for quantum branching programs
On lower bounds for parity branching programs
Complexity theoretical results for randomized branching programs
Classical simulation complexity of quantum branching programs : (draft)
Incremental branching programs
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
Modified branching programs and their computational power
Classical vs. quantum read once branching programs
Modified branching programs and their computational power
Complexity Bounds for Block-IPs
Probalistic Accuracy Bounds for Perdorated Programs
Probalistic Accuracy Bounds for Perforated Programs
Complexity bounds on some fundamental computational problems for quantum branching programs
On lower bounds for parity branching programs
Complexity theoretical results for randomized branching programs
Classical simulation complexity of quantum branching programs : (draft)
Incremental branching programs
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
Modified branching programs and their computational power
Classical vs. quantum read once branching programs
Modified branching programs and their computational power
Complexity Bounds for Block-IPs
Probalistic Accuracy Bounds for Perdorated Programs