AbstractWe call a group G algorithmically finite if no algorithm can produce an infinite set of pairwise distinct elements of G. We construct examples of recursively presented infinite algorithmically finite groups and study their properties. For instance, we show that the Equality Problem is decidable in our groups only on strongly (exponentially) negligible sets of inputs
In this thesis we study algorithmic aspects of balanced group presentations which are finite present...
AbstractWe present an algorithm to decide whether a finitely generated linear group over an infinite...
We address the question: for which collections of finite simple groups does there exist an algorithm...
AbstractWe call a group G algorithmically finite if no algorithm can produce an infinite set of pair...
This book describes the basic algorithmic ideas behind accepted methods for computing with finitely ...
AbstractA finite group G having n elements is said to be sequenceable if there exists an arrangement...
We survey recent progress in computing with finitely generated linear groups over infinite fields, d...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
AbstractLet G be a finitely generated group such that the word problem for G is En-decidable for som...
Abstract. The word problem for discrete groups is well-known to be undecidable by a Turing Machine; ...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
Let R be the ring of integers or a number field. We present several algorithms for working with poly...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
AbstractA finite group G having n elements is said to be sequenceable if there exists an arrangement...
In this thesis we study algorithmic aspects of balanced group presentations which are finite present...
AbstractWe present an algorithm to decide whether a finitely generated linear group over an infinite...
We address the question: for which collections of finite simple groups does there exist an algorithm...
AbstractWe call a group G algorithmically finite if no algorithm can produce an infinite set of pair...
This book describes the basic algorithmic ideas behind accepted methods for computing with finitely ...
AbstractA finite group G having n elements is said to be sequenceable if there exists an arrangement...
We survey recent progress in computing with finitely generated linear groups over infinite fields, d...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
AbstractLet G be a finitely generated group such that the word problem for G is En-decidable for som...
Abstract. The word problem for discrete groups is well-known to be undecidable by a Turing Machine; ...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
Let R be the ring of integers or a number field. We present several algorithms for working with poly...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
AbstractA finite group G having n elements is said to be sequenceable if there exists an arrangement...
In this thesis we study algorithmic aspects of balanced group presentations which are finite present...
AbstractWe present an algorithm to decide whether a finitely generated linear group over an infinite...
We address the question: for which collections of finite simple groups does there exist an algorithm...
DOI
Add to ORKG