The complexity of finding tangles

DOI10.1007/978-3-031-23101-8_1zbMath1529.68183arXiv2002.12251OpenAlexW3006803450MaRDI QIDQ6114453

Boris Klemz, Oksana Firman, Philipp Kindermann, O. V. Ravskyj, Alexander Wolff, Johannes Zink

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.12251

zbMATH Keywords

NP-hardnesstangleFPTexponential-time algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A function for evaluating the computing time of a bubbling system
• Visualizing the template of a chaotic attractor
• Knotted periodic orbits in dynamical systems. I: Lorenz's equations
• Computing height-optimal tangles faster
• Representing Permutations with Few Moves
• Drawing Permutations with Few Corners
• Classification of strange attractors by integers
• The complexity of satisfiability problems

This page was built for publication: The complexity of finding tangles