On the complexity of sails. Appendix by Frederick Manners.

DOI10.2140/pjm.2012.258.1zbMath1282.20044arXiv1102.1365OpenAlexW2082698914MaRDI QIDQ450504

Lukas Brantner

Publication date: 13 September 2012

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

polyhedraNP-complete problemscomputational geometrycomplexity theoryword lengthsbounded cohomologyNP-hard problemsstable commutator lengthsCalegari algorithmgeneric behaviourP=NPsailsscl

Mathematics Subject Classification ID

Applications of graph theory (05C90) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Topological methods in group theory (57M07) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Commutator calculus (20F12)

Related Items (2)

The mod 2 homology of free spectral Lie algebras ⋮ Spectral Algebra Models of Unstable $$v_n$$-Periodic Homotopy Theory

This page was built for publication: On the complexity of sails. Appendix by Frederick Manners.