ON COMPLEXITY OF THE EXISTENTIAL AND UNIVERSAL THEORIES OF FINITE FIELDS

DOI10.17223/20710410/45/9zbMath1461.03029OpenAlexW2988752140MaRDI QIDQ5151279

Alexander N. Rybalov

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm674

zbMATH Keywords

finite fieldsNP-hardnessuniversal theoryexistential theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite fields (field-theoretic aspects) (12E20) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Algebraic geometry over algebraic structures. III: Equationally Noetherian property and compactness
• The elementary theory of finite fields

This page was built for publication: ON COMPLEXITY OF THE EXISTENTIAL AND UNIVERSAL THEORIES OF FINITE FIELDS