Solving the Conjugacy Decision Problem via Machine Learning

DOI10.1080/10586458.2018.1434704zbMath1481.20119arXiv1705.10417OpenAlexW2963424125MaRDI QIDQ4960480

Robert M. Haralick, Jonathan Gryak, Delaram Kahrobaei

Publication date: 16 April 2020

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.10417

zbMATH Keywords

conjugacygroup theorypolycyclic groupmachine learningnon-commutative cryptography

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational methods for problems pertaining to group theory (20-08)

Related Items (2)

A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs ⋮ Evolution of group-theoretic cryptology attacks using hyper-heuristics

Uses Software

• GAP
• Scikit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The status of polycyclic group-based cryptography: a survey and open problems
• The conjugacy problem in the Grigorchuk group is polynomial time decidable.
• Randomness and complexity in matrix groups
• Generic-case complexity, decision problems in group theory, and random walks.
• Growth of finitely generated solvable groups
• Growth of finitely generated solvable groups and curvature of Riemannian manifolds
• A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
• Recursive Unsolvability of a problem of Thue
• THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS
• Random forests

This page was built for publication: Solving the Conjugacy Decision Problem via Machine Learning