scientific article; zbMATH DE number 67424
From MaRDI portal
Publication:4012134
Recommendations
Cited in
(69)- Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
- Generic-case complexity, decision problems in group theory, and random walks.
- Følner functions and the generic word problem for finitely generated amenable groups
- Viability of decision-making systems in human and animal groups
- Homological characterization of the unknot
- Groups with decidable word problem that do not embed in groups with decidable conjugacy problem
- Epimorphism testing with virtually abelian targets
- On decidability of amenability in computable groups
- A computational approach to Shephard groups
- Punctual copies of algebraic structures
- Linear groups and computation
- Detecting properties from descriptions of groups
- Algorithmic recognition of infinite cyclic extensions
- Decision problems and profinite completions of groups.
- Amalgamated free product of groups: normal forms and measures.
- The SQ-universality and residual properties of relatively hyperbolic groups.
- Unrecognizability of manifolds
- Satisfaction of existential theories in finitely presented groups and some embedding theorems.
- On Constructive Nilpotent Groups
- An application of Poénaru's ``zipping theory
- Search and witness problems in group theory.
- Asymptotic invariants, complexity of groups and related problems.
- Quid pro quo: Reflections on the value of problem structuring group workshops
- Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
- scientific article; zbMATH DE number 3897215 (Why is no real title available?)
- scientific article; zbMATH DE number 3924457 (Why is no real title available?)
- scientific article; zbMATH DE number 3959758 (Why is no real title available?)
- scientific article; zbMATH DE number 3961953 (Why is no real title available?)
- Decidable Properties of Polycyclic Groups
- Unsolvable Problems About Small Cancellation and Word Hyperbolic Groups
- scientific article; zbMATH DE number 1940371 (Why is no real title available?)
- scientific article; zbMATH DE number 1972766 (Why is no real title available?)
- Discriminating and co-discriminating groups
- Problem structuring methods for large group interventions
- Degrees of unsolvability of first order decision problems for finitely presented groups
- Amenable groups without finitely presented amenable covers
- Algorithmic theory of solvable groups
- On the homeomorphism problem for 4-manifolds
- ON THE RECOGNITION OF RIGHT-ANGLED ARTIN GROUPS
- CRYPTANALYSIS OF USHAKOV — SHPILRAIN’S AUTHENTICATION PROTOCOL BASED ON THE TWISTED CONJUGACY PROBLEM
- Groups with two generators having unsolvable word problem and presentations of Mihailova subgroups of braid groups
- Logspace computations in graph products
- Malnormality is undecidable in hyperbolic groups
- L 2 -Betti numbers and computability of reals
- On symplectic stabilisations and mapping classes
- The problem of solvability of a positive theory of an arbitrary group is algorithmically unsolvable
- The complexity of central series in nilpotent computable groups
- Algorithmically finite groups.
- Computable Scott sentences and the weak Whitehead problem for finitely presented groups
- Decision problems in information theory
- Friedberg splittings of recursively enumerable sets
- A group-theoretic framework for low-dimensional topology, or: how not to study low-dimensional topology?
- The conjugacy problem for ascending HNN-extensions of free groups
- The right angled Artin group functor as a categorical embedding
- Remarks and problems about algorithmic descriptions of groups
- Persistent homotopy groups of metric spaces
- Computing centralisers in [finitely generated free]-by-cyclic groups
- Average-case complexity and decision problems in group theory.
- Finding non-trivial elements and splittings in groups.
- Introduction to the special issue ``Beliefs in groups of \textit{Theory and Decision}
- HNN extensions and embedding theorems for groups
- On the intersection of fixed subgroups of F_n F_m
- Real computational universality: the word problem for a class of groups with infinite presentation
- The word and order problems for self-similar and automata groups
- Aspherical manifolds, relative hyperbolicity, simplicial volume and assembly maps.
- Applying Gröbner basis techniques to group theory.
- The triviality problem for profinite completions
- On the Markov theorem on algorithmic nonrecognizability of manifolds
- The isomorphism problem for torsion-free abelian groups is analytic complete
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012134)
