Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Word problem for groups
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Using a systematic computer search, a simple four-dimensional chaotic flow was found that has the unusual feature of having a… Expand
2014
2014
1. Preliminaries from Theoretical Computer Science.- 2. Preliminaries from Combinatorial Group Theory.- 3. Algorithms on… Expand
2012
2012
We consider the algebraic K-theory of a truncated polynomial algebra in several commuting variables, K(k[x_1, ..., x_n]/(x_1^a_1… Expand
Highly Cited
2007
Highly Cited
2007
Using rewriting techniques, we get a quite simple proof of undecidability of the word problem for groups (Novikov-Boone theorem).
2002
2002
It is shown that all nontrivial elements in higher K-groups of toric varieties are annihilated by iterations of the natural… Expand
Highly Cited
2000
Highly Cited
2000
Given a row-finite k-graph Λ with no sources we investigate the K-theory of the higher rank graph C *-algebra, C * (Λ). When k… Expand
1999
1999
This paper studies the word problem for finitely presented groups under the restriction that words can only be rewritten for a… Expand
Highly Cited
1996
Highly Cited
1996
This paper presents extensions and improvements of recently developed algorithms for the numerical analysis of orbits homoclinic… Expand
1982
1982
There are many ways that group actions enter into algebraic K-theory and there are various theories that fit under the rubric of… Expand
Highly Cited
1973
Highly Cited
1973
where Az = A[z, z ] is the Laurent extension ring of A, with involution z h> z~. (Cf. Part III, [5], for the generalization to… Expand