- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
31 cm
- Extent
-
x, 147 Blätter
- Language
-
Englisch
- Notes
-
Technische Universität Dresden, Dissertation, 2020
- Classification
-
Mathematik
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 11:48 AM CET
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
Time of origin
- [2020]
Other Objects (12)
Valued Constraint Satisfaction Problems over Infinite Domains
Constraint satisfaction with infinite domains
Constraint satisfaction with infinite domains
The complexity of valued constraint satisfaction problems
Markov logic in infinite domains
Computational complexity of infinite-valued Lukasiewicz propositional logic
Constraint satisfaction with succinctly specified relations
New algebraic tools for constraint satisfaction
CONSAT, a system for constraint satisfaction
Exact algorithms for constraint satisfaction problems
Nonaxiomatizability and undecidability of an infinite-valued temporal logic
Vector-valued elliptic boundary value problems on rough domains
Valued Constraint Satisfaction Problems over Infinite Domains
Constraint satisfaction with infinite domains
Constraint satisfaction with infinite domains
The complexity of valued constraint satisfaction problems
Markov logic in infinite domains
Computational complexity of infinite-valued Lukasiewicz propositional logic
Constraint satisfaction with succinctly specified relations
New algebraic tools for constraint satisfaction
CONSAT, a system for constraint satisfaction
Exact algorithms for constraint satisfaction problems
Nonaxiomatizability and undecidability of an infinite-valued temporal logic
Vector-valued elliptic boundary value problems on rough domains
Valued Constraint Satisfaction Problems over Infinite Domains
Constraint satisfaction with infinite domains
Constraint satisfaction with infinite domains
The complexity of valued constraint satisfaction problems
Markov logic in infinite domains
Computational complexity of infinite-valued Lukasiewicz propositional logic
Constraint satisfaction with succinctly specified relations
New algebraic tools for constraint satisfaction
CONSAT, a system for constraint satisfaction
Exact algorithms for constraint satisfaction problems
Nonaxiomatizability and undecidability of an infinite-valued temporal logic