http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

The 2-Attractor Problem Is NP-Complete

Fuchs, Janosch (Corresponding author)^RWTH* ; Whittington, Philip (Corresponding author)

In
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov, Seiten/Artikel-Nr: 35, [1]-13

2024

Konferenz/Event:41. International Symposium on Theoretical Aspects of Computer Science , Clermont-Ferrand , France , STACS 2024 , 2024-03-11 - 2024-03-14

ImpressumWadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

Umfang35, [1]-13

ISBN978-3-95977-311-9

ReiheLeibniz international proceedings in informatics ; 289

Online
DOI: 10.18154/RWTH-2024-09648
DOI: 10.4230/LIPICS.STACS.2024.35
10.4230/LIPICS.STACS.2024.35
URL: https://publications.rwth-aachen.de/record/994994/files/994994.pdf

Einrichtungen

1. IT Center (022000)

Inhaltliche Beschreibung (Schlagwörter)
String attractors (Genormte SW) ; Theory of computation → Approximation algorithms analysis (Genormte SW) ; Theory of computation → Data compression (Genormte SW) ; Theory of computation → Problems, reductions and completeness (Genormte SW) ; computational complexity (Genormte SW) ; dictionary compression (Genormte SW)

OpenAccess:
PDF

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-85187784859
WOS Core Collection: WOS:001300393400035

Interne Identnummern
RWTH-2024-09648
Datensatz-ID: 994994

Beteiligte Länder
Germany, Switzerland