Alexei Miasnikov
ABSTRACT
We consider the word search problem in the Baumslag-Gersten group GB. We show that the parameterized complexity of this problem, where the area of van Kampen diagram serves as a parameter, is polynomial in the length of the input and the parameter. This contrasts the well-known result that the Dehn function and the time complexity of the word search problem in GB are non-elementary.
- G. Baumslag. 1969. A non-cyclic one-relator group all of whose finite quotients are cyclic: To Bernhard Hermann Neumann on his 60th birthday. Journal of the Australian Mathematical Society 10, 3--4 (1969), 497--498. Google Scholar
Cross Ref
- W.W. Boone. 1958. The word problem. Proceedings of the National Academy of Sciences of the United States of America 44, 10 (1958), 1061.Google ScholarCross Ref
- J. Chen, I. A Kanj, and G. Xia. 2006. Improved parameterized upper bounds for vertex cover. In International symposium on mathematical foundations of computer science. Springer, 238--249.Google Scholar
- I.M. Chiswell, D.J. Collins, and J. Huebschmann. 1981. Aspherical group presentations. Mathematische Zeitschrift 178, 1 (1981), 1--36.Google ScholarCross Ref
- R.G. Downey and M.R. Fellows. 2012. Parameterized complexity. Springer Science & Business Media.Google Scholar
- S.M. Gersten. 1992. Dehn Functions and l1-norms of Finite Presentations. Springer New York, New York, NY, 195--224. Google ScholarCross Ref
- R.M. Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. Springer, 85--103.Google Scholar
- R. Lyndon and P. Schupp. 2001. Combinatorial Group Theory. Springer.Google Scholar
- A. Myasnikov, A. Ushakov, and D.W. Won. 2011. The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. Journal of Algebra 345, 1 (2011), 324--342. Google ScholarCross Ref
- P.S. Novikov. 1955. On algoritmic unsolvability of the word problem in the theory of groups (in Russian). Tr. Mat. Inst. Akad. Nauk SSSR, Izd. Akad. Nauk SSSR 44 (1955).Google Scholar
- M. Sapir. 2014. A Higman embedding preserving asphericity. Journal of the American Mathematical Society 27, 1 (2014), 1--42.Google ScholarCross Ref
- M.V. Sapir, J.-C. Birget, and E. Rips. 2002. Isoperimetric and isodiametric functions of groups. Ann. Math. 156, 2 (2002), 345--466.Google ScholarCross Ref
Index Terms
- On parameterized complexity of the word search problem in the Baumslag-Gersten group
Recommendations
On Hardness of Approximating the Parameterized Clique Problem
ITCS '16: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer ScienceIn the Gap-clique (k, k/2) problem, the input is an n-vertex graph G, and the goal is to decide whether G contains a clique of size k or contains no clique of size k/2. It is an open question in the study of fixed parameterized tractability whether the ...
Parameterized complexity dichotomy for Steiner Multicut
We consider the Steiner Multicut problem, which asks, given an undirected graph G, a collection T = { T 1 , ź , T t } , T i ź V ( G ) , of terminal sets of size at most p, and an integer k, whether there is a set S of at most k edges or nodes such that ...
Parameterized complexity of discrete morse theory
SoCG '13: Proceedings of the twenty-ninth annual symposium on Computational geometryOptimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on 3-manifolds, ...
Comments