;
In
52nd International Colloquium on Automata, Languages, and Programming : ICALP 2025, July 8–11, 2025, Aarhus, Denmark / edited by Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, Gabriele Puppis, Seiten/Artikel-Nr: 166:1-166:17
2025
Online
URN: urn:nbn:de:0030-drops-235431
DOI: 10.4230/LIPICS.ICALP.2025.166
DOI: 10.18154/RWTH-2026-05664
URL: https://publications.rwth-aachen.de/record/1036678/files/1036678.pdf
Einrichtungen
Inhaltliche Beschreibung (Schlagwörter)
Theory of computation → Complexity theory and logic (Genormte SW) ; Theory of computation → Finite Model Theory (Genormte SW) ; Theory of computation → Problems, reductions and completeness (Genormte SW) ; Tseitin (Genormte SW) ; affine relaxation (Genormte SW) ; cohomological k-consistency algorithm (Genormte SW) ; constraint satisfaction (Genormte SW) ; graph isomorphism (Genormte SW) ; promise CSPs (Genormte SW) ; ℤ-affine k-consistency (Genormte SW)
OpenAccess:
PDF
External link:
Fulltext by OpenAccess repository
Dokumenttyp
Contribution to a book/Contribution to a conference proceedings
Format
online
Sprache
English
Anmerkung
Peer review status of article unknown
Externe Identnummern
SCOPUS: SCOPUS:2-s2.0-105009887693
WOS Core Collection: WOS:001740139600166
Interne Identnummern
RWTH-2026-05664
Datensatz-ID: 1036678
Beteiligte Länder
Germany, UK