- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
On Classifying Continuous Constraint Satisfaction Problems ; volume:3 ; year:2024
TheoretiCS ; 3 (2024)
- Klassifikation
-
Informatik
- Urheber
-
Miltzow, Tillmann
Schmiermann, Reinier F.
- Beteiligte Personen und Organisationen
-
Computer Science Department, Utrecht University
Mathematics Department, Utrecht University
- DOI
-
10.46298/theoretics.24.10
- URN
-
urn:nbn:de:101:1-2407151703047.188106737296
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:45 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
- Miltzow, Tillmann
- Schmiermann, Reinier F.
- Computer Science Department, Utrecht University
- Mathematics Department, Utrecht University
Ähnliche Objekte (12)
Exact algorithms for constraint satisfaction problems
Parameterized complexity of constraint satisfaction problems
Valued constraint satisfaction problems over infinite domains
Solving timetable problem with constraint satisfaction method
The complexity of valued constraint satisfaction problems
The Constraint Satisfaction Problem: Complexity and Approximability
Enumerating all solutions for constraint satisfaction problems
Valued Constraint Satisfaction Problems over Infinite Domains
On the complexity of constraint satisfaction problems
Service robot planning via solving constraint satisfaction problem
Optimierung und Regularisierung von Constraint Satisfaction-Problemen (CSPs)
The Complexity of the Distributed Constraint Satisfaction Problem
Exact algorithms for constraint satisfaction problems
Parameterized complexity of constraint satisfaction problems
Valued constraint satisfaction problems over infinite domains
Solving timetable problem with constraint satisfaction method
The complexity of valued constraint satisfaction problems
The Constraint Satisfaction Problem: Complexity and Approximability
Enumerating all solutions for constraint satisfaction problems
Valued Constraint Satisfaction Problems over Infinite Domains
On the complexity of constraint satisfaction problems
Service robot planning via solving constraint satisfaction problem
Optimierung und Regularisierung von Constraint Satisfaction-Problemen (CSPs)
The Complexity of the Distributed Constraint Satisfaction Problem
Exact algorithms for constraint satisfaction problems
Parameterized complexity of constraint satisfaction problems
Valued constraint satisfaction problems over infinite domains
Solving timetable problem with constraint satisfaction method
The complexity of valued constraint satisfaction problems
The Constraint Satisfaction Problem: Complexity and Approximability
Enumerating all solutions for constraint satisfaction problems
Valued Constraint Satisfaction Problems over Infinite Domains
On the complexity of constraint satisfaction problems
Service robot planning via solving constraint satisfaction problem
Optimierung und Regularisierung von Constraint Satisfaction-Problemen (CSPs)