Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 14, Issue , 2012, Pages 218-229

  Diekert, Volker ^a   Laun, Jürn ^a   Ushakov, Alexander ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b Stevens Institute of Technology   (United States)

Author keywords

Algorithmic group theory; Compression; Data structures; Word Problem

Indexed keywords

COMPRESSED DATUM; NEW APPLICATIONS; POLYNOMIAL-TIME; POWER CIRCUIT; QUADRATIC TIME; STEVENS INSTITUTE OF TECHNOLOGY; TIME COMPLEXITY; WORD PROBLEM;

COMPACTION; COMPUTER SCIENCE; DATA STRUCTURES; GROUP THEORY; POLYNOMIAL APPROXIMATION;

ALGORITHMS;

EID: 84880317249     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2012.218     Document Type: Conference Paper

References (28)

1. G. Baumslag. A non-cyclic one-relator group all of whose finite quotients are cyclic. J. Austr. Math. Soc., 10(3-4): 497-498, 1969.
2. G. Baumslag, A. G. Myasnikov, and V. Shpilrain. Open problems in combinatorial group theory. Second Edition. In Combinatorial and geometric group theory, volume 296 of Contemporary Mathematics, pages 1-38. American Mathematical Society, 2002.
3. W. W. Boone. The Word Problem. Annals of Mathematics, 70(2): 207-265, 1959.
4. J.-Y. Cai. Parallel computation over hyperbolic groups. In Proc. 24th ACM Symp. on Theory of Computing, STOC 92, pages 106-115. ACM-press, 1992.
5. M. Dehn. Über unendliche diskontinuierliche Gruppen. Math. Ann., 71(1): 116-144, 1911.
6. V. Diekert, A. J. Duncan, and A. G. Myasnikov. Geodesic rewriting systems and pregroups. In O. Bogopolski et al. (eds.), Combinatorial and Geometric Group Theory, Trends in Mathematics, pages 55-91. Birkhäuser, 2010.
7. V. Diekert, J. Laun, and A. Ushakov. Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P. ArXiv e-prints, Mar. 2011.
8. W. Dison and T. R. Riley. Hydra groups. ArXiv e-prints, abs/1002.1945, Feb. 2010.
9. S. M. Gersten. Isodiametric and isoperimetric inequalities in group extensions. 1991.
10. G. Higman. A finitely generated infinite simple group. J. LMS, 26: 61-64, 1951.
11. I. Kapovich, A. G. Miasnikov, P. Schupp, and V. Shpilrain. Generic-case complexity, decision problems in group theory and random walks. J. Algebra, 264: 665-694, 2003.
12. M. Lohrey. Word problems and membership problems on compressed words. SIAM J. Comput., 35(5): 1210-1240, 2006.
13. M. Lohrey and S. Schleimer. Efficient computation in groups via compression. In V. Diekert et al. (eds.), CSR, LNCS, 4649: 249-258. Springer, 2007.
14. M. Lohrey and G. Sénizergues. Theories of HNN-extensions and amalgamated products. In M. Bugliesi et al. (eds.), ICALP, LNCS, 4052: 504-515. Springer, 2006.
15. R. Lyndon and P. Schupp. Combinatorial Group Theory. Springer, 2001.
16. K. Madlener and F. Otto. Pseudo-natural algorithms for finitely generated presentations of monoids and groups. J. Symb. Comput., 5: 339-358, 1988.
17. W. Magnus. Das Identitätsproblem für Gruppen mit einer definierenden Relation. Math. Ann., 106: 295-307, 1932.
18. A. G. Myasnikov, A. Ushakov, and D. W. Won. Power circuits, exponential algebra, and time complexity. ArXiv e-prints, abs/1006.2570, 2010. To appear in IJAC.
19. A. G. Myasnikov, A. Ushakov, and D. W. Won. The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. Journal of Algebra, 345(1): 324-342, 2011.
20. A. G. Myasnikov and S. Ushakov. Cryptography And Groups (CRAG). Software Library.
21. P. S. Novikov. On the algorithmic unsolvability of the word problem in group theory. Trudy Mat. Inst. Steklov, pages 1-143, 1955. In Russian.
22. A. Y. Ol'shanskii. Almost every group is hyperbolic. Int. J. Alg. Comp., 2: 1-17, 1992.
23. F. Otto, D. E. Cohen, and K. Madlener. Separating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups. Math. Log. Q., 39: 143-157, 1993.
24. A. N. Platonov. Isoparametric function of the Baumslag-Gersten group. Vestnik Moskov. Univ. Ser. I Mat. Mekh., 3: 12-17, 2004. Russian.
25. Engl. transl. Moscow Univ. Math. Bull. 59 (3) (2004), 12-17.
26. M. V. Sapir, J.-C. Birget, and E. Rips. Isoperimetric and Isodiametric Functions of Groups. Ann. Math., 156: 345-466, 2002.
27. S. Schleimer. Polynomial-time word problems. Comm. Math. Helv., 83: 741-765, 2008.
28. J.-P. Serre. Trees. Springer, 1980.