Quotient tests and random walks in computational group theory.

zbMATH Open1106.20026MaRDI QIDQ5488871FDOQ5488871

Authors: Alexandre V. Borovik, Alexei Myasnikov 

Publication date: 25 September 2006

Recommendations

• Generic-case complexity, decision problems in group theory, and random walks.
• Quotient tests and Gröbner bases.
• scientific article
• scientific article
• The product replacement algorithm and Kazhdan's property (T)

zbMATH Keywords

efficiencyCayley graphsrandom walksconjugacy problemword problemdecision problemsfinitely presented groupsdecision algorithmsfinite quotient groupsidentity problemquotient tests

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Sums of independent random variables; random walks (60G50) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Probabilistic methods in group theory (20P05)

Cited In (3)

• Random equations in nilpotent groups.
• Exponentially generic subsets of groups
• Quotient tests and Gröbner bases.

This page was built for publication: Quotient tests and random walks in computational group theory.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488871)