h1

h2

h3

h4

h5
h6
%0 Conference Paper
%A Fuchs, Janosch
%A Whittington, Philip
%T The 2-Attractor Problem Is NP-Complete
%V 289
%C Wadern
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
%M RWTH-2024-09648
%B Leibniz international proceedings in informatics
%P 35, [1]-13
%D 2024
%< 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
%B 41. International Symposium on Theoretical Aspects of Computer Science
%C 11 Mar 2024 - 14 Mar 2024, Clermont-Ferrand (France)
Y2 11 Mar 2024 - 14 Mar 2024
M2 Clermont-Ferrand, France
%K String attractors (Other)
%K Theory of computation → Approximation algorithms analysis (Other)
%K Theory of computation → Data compression (Other)
%K Theory of computation → Problems, reductions and completeness (Other)
%K computational complexity (Other)
%K dictionary compression (Other)
%F PUB:(DE-HGF)7 ; PUB:(DE-HGF)8
%9 Contribution to a bookContribution to a conference proceedings
%U <Go to ISI:>//WOS:001300393400035
%R 10.4230/LIPICS.STACS.2024.35
%U https://publications.rwth-aachen.de/record/994994