APPROXIMATION OF GEODESICS IN METABELIAN GROUPS

DOI10.1142/S0218196711006789zbMath1251.20034arXiv1106.4035MaRDI QIDQ5389112

O. G. Kharlampovich, Atefeh Mohajeri Moghaddam

Publication date: 24 April 2012

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

complexitygeodesicsNP-complete problemsmetabelian groupsalgorithmic problemsgeodesic problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Solvable groups, supersolvable groups (20F16) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

Dead ends on wreath products and lamplighter groups ⋮ Some degree and distance-based invariants of wreath products of graphs

Cites Work

• Linear time algorithms for NP-hard problems restricted to partial k- trees
• The word and geodesic problems in free solvable groups

This page was built for publication: APPROXIMATION OF GEODESICS IN METABELIAN GROUPS