Hochschulschrift
A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Potsdam, Univ., Diss., 2005
- Schlagwort
-
Binäres Entscheidungsdiagramm ; Erfüllbarkeitsproblem
- Urheber
-
Ghasemzadeh, Mohammad
- URN
-
urn:nbn:de:kobv:517-opus-6378
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:55 MEZ
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
- Ghasemzadeh, Mohammad
Ähnliche Objekte (12)
Satisfiability of the smallest binary program
Satisfiability of the smallest binary program
Iron - binary phase diagrams
A Java library For Zero-Suppressed Decision Diagrams
Binary decision diagrams and integer programming
Binary decision diagrams for random Boolean functions
Binary decision diagrams for random Boolean functions
Dynamic fault tree analysis using binary decision diagrams
Analyzing Feature-Model Histories with Binary Decision Diagrams
Hashing Strategies for Concurrent Building of Binary Decision Diagrams
Satisfiability problems
Generalized satisfiability problems
Satisfiability of the smallest binary program
Satisfiability of the smallest binary program
Iron - binary phase diagrams
A Java library For Zero-Suppressed Decision Diagrams
Binary decision diagrams and integer programming
Binary decision diagrams for random Boolean functions
Binary decision diagrams for random Boolean functions
Dynamic fault tree analysis using binary decision diagrams
Analyzing Feature-Model Histories with Binary Decision Diagrams
Hashing Strategies for Concurrent Building of Binary Decision Diagrams
Satisfiability problems
Generalized satisfiability problems
Satisfiability of the smallest binary program
Satisfiability of the smallest binary program
Iron - binary phase diagrams
A Java library For Zero-Suppressed Decision Diagrams
Binary decision diagrams and integer programming
Binary decision diagrams for random Boolean functions
Binary decision diagrams for random Boolean functions
Dynamic fault tree analysis using binary decision diagrams
Analyzing Feature-Model Histories with Binary Decision Diagrams
Hashing Strategies for Concurrent Building of Binary Decision Diagrams
Satisfiability problems