Name
Abstract | ||
|---|---|---|
We investigate the complexity of the following polynomial solvability problem: Given a finite field ${\mathbb F}_{q}$ and a set of polynomials $$f_{1}(x,y),f_{2}(x,y),...,f_{n}(x,y),g(x,y) \ \epsilon \ {\mathbb F}_{q} [x,y]$$ determine the ${\mathbb F}_{q}$-solvability of the system $$f_{1}(x,y)=f_{2}(x,y)=...=f_{n}(x,y)=0 \ {\rm and} \ {\it g}(x,y) \neq 0$$ We give a deterministic polynomial-time algorithm for this problem. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11523468_45 | ICALP |
Keywords | Field | DocType |
finite field,deterministic polynomial-time algorithm,bivariate polynomial equation,following polynomial solvability problem,mathbb f | Discrete mathematics,Combinatorics,Finite field,Polynomial,Field equation,Factorization of polynomials,Permutation polynomial,Bivariate polynomials,Mathematics,Polynomial method | Conference |
Volume | ISSN | ISBN |
3580 | 0302-9743 | 3-540-27580-0 |
Citations | PageRank | References |
2 | 0.40 | 15 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Neeraj Kayal | 1 | 263 | 19.39 |