On solving real-algebraic formulas in a satisfiability-modulo-theories framework
- Weitere Titel
-
Über das Lösen Reell-algebraischer Formeln in einem Satisfiability-modulo-theories Framework
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
RWTH Aachen University, Dissertation, 2018
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2018
- Urheber
- Beteiligte Personen und Organisationen
- DOI
-
10.18154/RWTH-2018-231963
- URN
-
urn:nbn:de:101:1-2019052907064286303743
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:44 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.
Beteiligte
- Loup, Ulrich
- Ábrahám, Erika
- Levandovskyy, Viktor
- Sturm, Thomas
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2018
Ähnliche Objekte (12)
Satisfiability Modulo Exponential Integer Arithmetic
Proof complexity of Satisfiability Modulo Theories
Solving the 3-Satisfiability Problem Using Network-Based Biocomputation
Verification of Stochastic Systems by Stochastic Satisfiability Modulo Theories with Continuous Domain (CSSMT)
Thom-Porteous formulas in algebraic cobordism
Thom-Porteous formulas in algebraic cobordism
Stochastic satisfiability modulo theories : a symbolic technique for the analysis of probabilistic hybrid systems
Stochastic satisfiability modulo theories : a symbolic technique for the analysis of probabilistic hybrid systems
On the complexity of solving propositional formulas
Solving algebraic problems with high accuracy
Satisfiability problems
On the locality of arb-invariant first-order formulas with modulo counting quantifiers
Satisfiability Modulo Exponential Integer Arithmetic
Proof complexity of Satisfiability Modulo Theories
Solving the 3-Satisfiability Problem Using Network-Based Biocomputation
Verification of Stochastic Systems by Stochastic Satisfiability Modulo Theories with Continuous Domain (CSSMT)
Thom-Porteous formulas in algebraic cobordism
Thom-Porteous formulas in algebraic cobordism
Stochastic satisfiability modulo theories : a symbolic technique for the analysis of probabilistic hybrid systems
Stochastic satisfiability modulo theories : a symbolic technique for the analysis of probabilistic hybrid systems
On the complexity of solving propositional formulas
Solving algebraic problems with high accuracy
Satisfiability problems
On the locality of arb-invariant first-order formulas with modulo counting quantifiers
Satisfiability Modulo Exponential Integer Arithmetic
Proof complexity of Satisfiability Modulo Theories
Solving the 3-Satisfiability Problem Using Network-Based Biocomputation
Verification of Stochastic Systems by Stochastic Satisfiability Modulo Theories with Continuous Domain (CSSMT)
Thom-Porteous formulas in algebraic cobordism
Thom-Porteous formulas in algebraic cobordism
Stochastic satisfiability modulo theories : a symbolic technique for the analysis of probabilistic hybrid systems
Stochastic satisfiability modulo theories : a symbolic technique for the analysis of probabilistic hybrid systems
On the complexity of solving propositional formulas
Solving algebraic problems with high accuracy
Satisfiability problems