guest ::
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
;
In
50th International Colloquium on Automata, Languages and Programming (ICALP 2023) / Herausgeber: Kousha Etessami, Uriel Feige, Gabriele Puppis, Seiten/Artikel-Nr: 101:1-101:18
2023
Online
DOI: 10.18154/RWTH-2023-06507
DOI: 10.4230/LIPICS.ICALP.2023.101
URL: https://publications.rwth-aachen.de/record/960915/files/960915.pdf
Einrichtungen
- Lehrstuhl für Informatik 7 (Logik und Theorie diskreter Systeme) (122910)
- Graduiertenkolleg UnRAVeL (080060)
- Fachgruppe Informatik (120000)
Inhaltliche Beschreibung (Schlagwörter)
Lasserre hierarchy (Genormte SW) ; Mathematics of computing → Combinatorics (Genormte SW) ; Mathematics of computing → Graph theory (Genormte SW) ; Sherali-Adams hierarchy (Genormte SW) ; graph isomorphism (Genormte SW) ; homomorphism indistinguishability (Genormte SW) ; linear programming (Genormte SW) ; semidefinite programming (Genormte SW) ; treewidth (Genormte SW)
OpenAccess: 
PDF
Dokumenttyp
Contribution to a book/Contribution to a conference proceedings
Format
online
Sprache
English
Anmerkung
Peer reviewed article
Externe Identnummern
SCOPUS: SCOPUS:2-s2.0-85167368828
Interne Identnummern
RWTH-2023-06507
Datensatz-ID: 960915
Beteiligte Länder
Denmark, Germany
Related:
Journal Article
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
TheoretiCS : an open access journal in theoretical computer science 3, 12321 (2024) [10.46298/theoretics.24.20]
Files
BibTeX |
EndNote:
XML,
Text |
RIS
Preprint
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
42 Seiten (2023) [10.48550/ARXIV.2302.10538]
Files Fulltext by arXiv.org
BibTeX |
EndNote:
XML,
Text |
RIS
; 
PDF