The Bounded and Precise Word Problems for Presentations of Groups
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Cancellation theory of groups; application of van Kampen diagrams (20F06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Research exposition (monographs, survey articles) pertaining to group theory (20-02)
- scientific article; zbMATH DE number 3695456
- Publication:3033961
- Finitely presented solvable groups and Lie algebras with unsolvable word problem
- On the difficulty of presenting finitely presentable groups.
- The word problem for geometrically finite groups
- The word problem and the isomorphism problem for groups
- A Bound on the Presentation Rank of a Finite Group
- scientific article; zbMATH DE number 895294
- ON THE WORD PROBLEM IN PERIODIC GROUP VARIETIES
- On the word problem for groups defined by periodic relations
- scientific article; zbMATH DE number 3114412 (Why is no real title available?)
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 51735 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 2146477 (Why is no real title available?)
- scientific article; zbMATH DE number 848039 (Why is no real title available?)
- scientific article; zbMATH DE number 3335104 (Why is no real title available?)
- scientific article; zbMATH DE number 3381862 (Why is no real title available?)
- scientific article; zbMATH DE number 3045417 (Why is no real title available?)
- scientific article; zbMATH DE number 3047078 (Why is no real title available?)
- scientific article; zbMATH DE number 3074066 (Why is no real title available?)
- Algorithms for Loop Matchings
- An O (log( n ) 4/3 ) space algorithm for ( s, t ) connectivity in undirected graphs
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- Combinatorial group theory.
- Computational Complexity
- Computing area in presentations of the trivial group
- Isoperimetric functions of groups and computational complexity of the word problem
- On Dehn functions of infinite presentations of groups.
- On finding a minimum dominating set in a tournament
- On limited nondeterminism and the complexity of the V-C dimension
- On the complexity of some problems on groups input as multiplication tables
- On the width of elements in free groups
- Recursive unsolvability of a problem of Thue
- Relationships between nondeterministic and deterministic tape complexities
- Speeding up the dynamic algorithm for planar RNA folding
- THE FREE BURNSIDE GROUPS OF SUFFICIENTLY LARGE EXPONENTS
- Tangent unit-vector fields: non-abelian homotopy invariants and the Dirichlet energy
- Tangent unit-vector fields: nonabelian homotopy invariants and the Dirichlet energy
- The word problem
- The word problem in semi-groups with cancellation
- Word Problems Solvable in Logspace
This page was built for publication: The Bounded and Precise Word Problems for Presentations of Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113919)
