Musings on generic-case complexity

DOI10.1515/9783110638387-014MaRDI QIDQ5115841zbMATH OpenOpenAlexFDO

Authors Ilya Kapovich

Publication date 21 August 2020

Published in Elementary Theory of Groups and Group Rings, and Related Topics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Semigroups (20Mxx) Cryptography (94A60)

Recommendations

• Generic Case Complexity and One-Way Functions
• Generic undecidability of universal theories
• On generic complexity of the validity problem for Boolean formulas
• On generic complexity of the discrete logarithm problem
• On the generic complexity of the searching graph isomorphism problem

Cited in

(4)

• Primitivity rank for random elements in free groups
• Generic properties of subgroups of free groups and finite presentations
• Generic Case Complexity and One-Way Functions
• Randomness and complexity in matrix groups

This page was built for publication: Musings on generic-case complexity

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