Hochschulschrift
Complexity theoretical results for randomized branching programs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783826548277
3826548272
- Dimensions
-
21 cm
- Extent
-
VIII, 141 S.
- Edition
-
Als Ms. gedr.
- Language
-
Englisch
- Notes
-
graph. Darst.
Zugl.: Dortmund, Univ., Diss., 1999
- Keyword
-
OBDD
Randomisierung
Komplexitätstheorie
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Shaker
- (when)
-
1999
- Creator
-
Sauerhoff, Martin
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:35 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Sauerhoff, Martin
- Shaker
Time of origin
- 1999
Other Objects (12)
Classical simulation complexity of quantum branching programs : (draft)
Incremental branching programs
Complexity bounds on some fundamental computational problems for quantum branching programs
Complexity bounds on some fundamental computational problems for quantum branching programs
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
Modified branching programs and their computational power
Modified branching programs and their computational power
Classical vs. quantum read once branching programs
On lower bounds for parity branching programs
Factorization of Polynomials Given by Arithmetic Branching Programs
Parameterized complexity of configuration integer programs
Channel concavity controls plan-form complexity of branching drainage networks
Classical simulation complexity of quantum branching programs : (draft)
Incremental branching programs
Complexity bounds on some fundamental computational problems for quantum branching programs
Complexity bounds on some fundamental computational problems for quantum branching programs
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
Modified branching programs and their computational power
Modified branching programs and their computational power
Classical vs. quantum read once branching programs
On lower bounds for parity branching programs
Factorization of Polynomials Given by Arithmetic Branching Programs
Parameterized complexity of configuration integer programs
Channel concavity controls plan-form complexity of branching drainage networks
Classical simulation complexity of quantum branching programs : (draft)
Incremental branching programs
Complexity bounds on some fundamental computational problems for quantum branching programs
Complexity bounds on some fundamental computational problems for quantum branching programs
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs
Modified branching programs and their computational power
Modified branching programs and their computational power
Classical vs. quantum read once branching programs
On lower bounds for parity branching programs
Factorization of Polynomials Given by Arithmetic Branching Programs
Parameterized complexity of configuration integer programs