- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Algebraic Global Gadgetry for Surjective Constraint Satisfaction ; volume:33 ; number:1 ; day:29 ; month:5 ; year:2024 ; pages:1-34 ; date:6.2024
Computational complexity ; 33, Heft 1 (29.5.2024), 1-34, 6.2024
- Urheber
-
Chen, Hubie
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00037-024-00253-4
- URN
-
urn:nbn:de:101:1-2409202107180.279940398776
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:27 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
- Chen, Hubie
- SpringerLink (Online service)
Ähnliche Objekte (12)
New algebraic tools for constraint satisfaction
CONSAT, a system for constraint satisfaction
Exact algorithms for constraint satisfaction problems
Constraint Network Satisfaction for Finite Relation Algebras
Enumerating all solutions for constraint satisfaction problems
The weak base method for constraint satisfaction
Graph Neural Networks for Maximum Constraint Satisfaction
A manifold-based approach to sparse global constraint satisfaction problems
Constraint satisfaction with infinite domains
Constraint satisfaction with infinite domains
Constraint satisfaction with succinctly specified relations
On Classifying Continuous Constraint Satisfaction Problems
New algebraic tools for constraint satisfaction
CONSAT, a system for constraint satisfaction
Exact algorithms for constraint satisfaction problems
Constraint Network Satisfaction for Finite Relation Algebras
Enumerating all solutions for constraint satisfaction problems
The weak base method for constraint satisfaction
Graph Neural Networks for Maximum Constraint Satisfaction
A manifold-based approach to sparse global constraint satisfaction problems
Constraint satisfaction with infinite domains
Constraint satisfaction with infinite domains
Constraint satisfaction with succinctly specified relations
On Classifying Continuous Constraint Satisfaction Problems
New algebraic tools for constraint satisfaction
CONSAT, a system for constraint satisfaction
Exact algorithms for constraint satisfaction problems
Constraint Network Satisfaction for Finite Relation Algebras
Enumerating all solutions for constraint satisfaction problems
The weak base method for constraint satisfaction
Graph Neural Networks for Maximum Constraint Satisfaction
A manifold-based approach to sparse global constraint satisfaction problems
Constraint satisfaction with infinite domains
Constraint satisfaction with infinite domains
Constraint satisfaction with succinctly specified relations