Complexity of solving algebraic equations

DOI10.1016/0020-0190(80)90134-9zbMath0487.68036OpenAlexW2052880810MaRDI QIDQ1165578

Aviezri S. Fraenkel, Yaacov Yesha

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90134-9

zbMATH Keywords

NP-completeNP-hardnesssolution of algebraic equations in a finite algebraic extension field

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic field extensions (12F05) Finite fields and commutative rings (number-theoretic aspects) (11T99)

Related Items (5)

Boolean ring cryptographic equation solving ⋮ Algebraic compressed sensing ⋮ QUAD: A Practical Stream Cipher with Provable Security ⋮ QUAD: A multivariate stream cipher with provable security ⋮ Hill Climbing Algorithms and Trivium

Cites Work

• Unnamed Item
• Complexity of problems in games, graphs and algebraic equations

This page was built for publication: Complexity of solving algebraic equations