On Solving Systems of Diagonal Polynomial Equations Over Finite Fields

DOI10.1007/978-3-319-19647-3_12zbMath1356.68280arXiv1503.09016OpenAlexW2418118208MaRDI QIDQ3452558

Miklos Santha, Gábor Ivanyos

Publication date: 12 November 2015

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmfinite fieldspolynomial equationsquantum computingChevalley-warning theorem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

On Solving Systems of Diagonal Polynomial Equations Over Finite Fields ⋮ Solving systems of diagonal polynomial equations over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of the parity argument and other inefficient proofs of existence
• An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
• Finding conjugate stabilizer subgroups in PSL(2; q) and related groups
• On Solving Systems of Diagonal Polynomial Equations Over Finite Fields
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Computation and Lattice Problems
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• Reducibility among Combinatorial Problems
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• Deterministic equation solving over finite fields
• Hidden Symmetry Subgroup Problems
• Hidden Translation and Translating Coset in Quantum Computing
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

This page was built for publication: On Solving Systems of Diagonal Polynomial Equations Over Finite Fields