Erratum to: ``Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption
DOI10.1515/GCC-2019-2009zbMATH Open1441.68062OpenAlexW2396019204WikidataQ127022972 ScholiaQ127022972MaRDI QIDQ2178754FDOQ2178754
Publication date: 11 May 2020
Published in: Groups - Complexity - Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/gcc-2019-2009
variety of groupscomputational groupgeneral integer-factoring intractability assumptionpseudo-free family of finite computational groups
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Factorization (11Y05) Quasivarieties and varieties of groups (20E10)
Cites Work
Recommendations
- Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption 👍 👎
- Pseudo-free families of finite computational elementary abelian \(p\)-groups 👍 👎
- Erratum: A family of polycyclic groups over which the uniform conjugacy problem is NP-complete 👍 👎
- Erratum to: ``Free abelian lattice-ordered groups 👍 👎
- ERRATUM: "ON RESTRICTING SUBSETS OF BASES IN RELATIVELY FREE GROUPS" 👍 👎
- Erratum to: Special primitive pairs in finite groups. 👍 👎
- Erratum to ``Order free integers \((\mod m)\) 👍 👎
- Title not available (Why is that?) 👍 👎
- Corrigendum to: ``The critical number of finite abelian groups 👍 👎
- The computational complexity of torsion-freeness of finitely presented groups 👍 👎
This page was built for publication: Erratum to: ``Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178754)
