Exploiting strict constraints in the computation of cylindrical algebraic coverings
- Weitere Titel
-
Ausnutzung von strikten Ungleichungen zur Berechnung von zylindrischen, algebraischen Abdeckungen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
RWTH Aachen University, Bachelorarbeit, 2022
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2023
- Urheber
-
Bär, Philipp
Nalbach, Jasper Kurt Ferdinand
- Beteiligte Personen und Organisationen
- DOI
-
10.18154/RWTH-2023-04217
- URN
-
urn:nbn:de:101:1-2023042601413049688126
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:46 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.
Beteiligte
- Bär, Philipp
- Nalbach, Jasper Kurt Ferdinand
- Ábrahám, Erika
- Giesl, Jürgen
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2023
Ähnliche Objekte (12)
Mechanized verification of imperative and functional programs
Exploiting Strict Constraints in the Cylindrical Algebraic Covering
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen
Cylindrical algebraic decomposition for nonlinear arithmetic problems
Term rewriting and applications : 16th international conference ; proceedings
Automated reasoning : 5th international joint conference ; proceedings
Proving Termination of C Programs with Lists
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Satisfiability Modulo Exponential Integer Arithmetic
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
Mechanized verification of imperative and functional programs
Exploiting Strict Constraints in the Cylindrical Algebraic Covering
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen
Cylindrical algebraic decomposition for nonlinear arithmetic problems
Term rewriting and applications : 16th international conference ; proceedings
Automated reasoning : 5th international joint conference ; proceedings
Proving Termination of C Programs with Lists
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Satisfiability Modulo Exponential Integer Arithmetic
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
Mechanized verification of imperative and functional programs
Exploiting Strict Constraints in the Cylindrical Algebraic Covering
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen
Cylindrical algebraic decomposition for nonlinear arithmetic problems
Term rewriting and applications : 16th international conference ; proceedings
Automated reasoning : 5th international joint conference ; proceedings
Proving Termination of C Programs with Lists
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Satisfiability Modulo Exponential Integer Arithmetic