Add to ORKGThere exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups
For every finitely generated recursively presented group G we construct a finitely presented group H...
We prove that for every finite rank Coxeter group there exists a polynomial (cubic) solution to the ...
139 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980.It is known that many decisio...
There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is...
We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the...
We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the...
International audienceWe remark that the conjugacy problem for pairs of hyperbolic automorphisms of ...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
A polynomial-time isomorphism test for a class of groups, properly containing the class of Abelian g...
Abstract. We consider pairs of finitely presented, residually finite groups P ↪ → Γ for which the in...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
The aim of this book is to provide an introduction to combinatorial group theory. Any reader who has...
We summarize several results about non-simplicity, solvability and normal structure of finite grou...
For every finitely generated recursively presented group G we construct a finitely presented group H...
We prove that for every finite rank Coxeter group there exists a polynomial (cubic) solution to the ...
139 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980.It is known that many decisio...
There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is...
We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the...
We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the...
International audienceWe remark that the conjugacy problem for pairs of hyperbolic automorphisms of ...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
A polynomial-time isomorphism test for a class of groups, properly containing the class of Abelian g...
Abstract. We consider pairs of finitely presented, residually finite groups P ↪ → Γ for which the in...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
The aim of this book is to provide an introduction to combinatorial group theory. Any reader who has...
We summarize several results about non-simplicity, solvability and normal structure of finite grou...
For every finitely generated recursively presented group G we construct a finitely presented group H...
We prove that for every finite rank Coxeter group there exists a polynomial (cubic) solution to the ...
139 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980.It is known that many decisio...