Algorithmic search in group theory

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A method of random search based on Kolmogorov complexity is proposed and applied to two search problems in group theory. Some experimental evidence as to the efficacy of the method is presented.

Original languageEnglish
Pages (from-to)237-244
Number of pages8
JournalJournal of Algebra
Volume545
DOIs
StatePublished - 1 Mar 2020

Keywords

  • Asymptotic density
  • Finitely presented groups
  • Kolmogorov complexity

Fingerprint

Dive into the research topics of 'Algorithmic search in group theory'. Together they form a unique fingerprint.

Cite this