Hochschulschrift | Online-Publikation
On lower bounds for parity branching programs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Göttingen, Univ., Diss., 2003
- Klassifikation
-
Informatik
- Schlagwort
-
Binäres Entscheidungsdiagramm
Komplexität
Untere Schranke
- Urheber
- URN
-
urn:nbn:de:gbv:7-webdoc-448-3
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:33 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
- Online-Publikation
Beteiligte
Ähnliche Objekte (12)
Lower Bounds for Possibly Divergent Probabilistic Programs
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
Exponential lower bounds for solving infinitary payoff games and linear programs
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
Parity of bound dipole states in 208Pb
Complexity theoretical results for randomized branching programs
Modified branching programs and their computational power
Modified branching programs and their computational power
Classical vs. quantum read once branching programs
Proportionality’s Lower Bound
Lower Bounds for Possibly Divergent Probabilistic Programs
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
Exponential lower bounds for solving infinitary payoff games and linear programs
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
Parity of bound dipole states in 208Pb
Complexity theoretical results for randomized branching programs
Modified branching programs and their computational power
Modified branching programs and their computational power
Classical vs. quantum read once branching programs
Proportionality’s Lower Bound
Lower Bounds for Possibly Divergent Probabilistic Programs
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
Exponential lower bounds for solving infinitary payoff games and linear programs
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
Parity of bound dipole states in 208Pb
Complexity theoretical results for randomized branching programs
Modified branching programs and their computational power
Modified branching programs and their computational power
Classical vs. quantum read once branching programs