scientific article; zbMATH DE number 7764106

DOI10.4230/LIPICS.IPEC.2020.15MaRDI QIDQ6089660FDOQ6089660

Authors: Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, Akira Suzuki 

Publication date: 13 November 2023

Title of this publication is not available (Why is that?)

zbMATH Keywords

nondeterministic constraint logicfixed parameter tractabilitycombinatorial reconfiguration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• The complexity of change
• Complexity of independent set reconfigurability problems
• On the complexity of reconfiguration problems
• Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
• The complexity of dominating set reconfiguration
• Parameterized Complexity of Graph Constraint Logic
• \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete
• Introduction to reconfiguration
• Parameterized complexity of the list coloring reconfiguration problem with graph parameters
• Reconfiguring undirected paths
• PSPACE-Completeness of Bloxorz and of Games with 2-Buttons
• Proof equivalence in MLL is PSPACE-complete
• Diameter of colorings under Kempe changes

Cited In (1)

• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089660)