Name
Abstract | ||
|---|---|---|
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the polynomial equations. Our algorithm works in time polynomial in the number of equations and the logarithm of the size of the field, whenever the degree of the polynomial equations is constant. As a consequence we design polynomial time quantum algorithms for two algebraic hidden structure problems: for the hidden subgroup problem in certain semidirect product p-groups of constant nilpotency class, and for the multi-dimensional univariate hidden polynomial graph problem when the degree of the polynomials is constant.1 |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.tcs.2016.04.045 | Theor. Comput. Sci. |
Keywords | Field | DocType |
Algorithm,Polynomial equations,Finite fields,Chevalley-Warning theorem,Quantum computing | Alternating polynomial,Discrete mathematics,Combinatorics,Stable polynomial,Polynomial matrix,Polynomial,Degree of a polynomial,Reciprocal polynomial,Monic polynomial,Matrix polynomial,Mathematics | Journal |
Volume | Issue | ISSN |
657 | PA | 0304-3975 |
Citations | PageRank | References |
0 | 0.34 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gábor Ivanyos | 1 | 257 | 28.02 |
| Miklos Santha | 2 | 728 | 92.42 |