On the complexity of sails. Appendix by Frederick Manners.
DOI10.2140/PJM.2012.258.1zbMATH Open1282.20044arXiv1102.1365OpenAlexW2082698914MaRDI QIDQ450504FDOQ450504
Authors: 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
Recommendations
computational geometrycomplexity theorypolyhedraNP-complete problemsNP-hard problemsword lengthsbounded cohomologystable commutator lengthsCalegari algorithmgeneric behaviourP=NPsailsscl
Applications of graph theory (05C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Topological methods in group theory (57M07) Commutator calculus (20F12)
Cited In (5)
This page was built for publication: On the complexity of sails. Appendix by Frederick Manners.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450504)