A black box approach to the algebraic set decomposition problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Extended Hilbert irreducibility and its applications
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Cryptographic Applications of Sparse Polynomials over Finite Rings
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
| Hi-index | 0.00 |
We consider the following polynomial congruences problem: given a prime p, and a set of polynomials f/sub 1/,...,f/sub m//spl isin/F/sub p/[x/sub 1/,...,x/sub n/] of total degree at most d, solve the system f/sub 1/=...=f/sub m/=0 for solution(s) in F/sub p//sup n/. We give a randomized algorithm for the decision version of this problem. When the system has F/sub p/-rational solutions our algorithm finds one of them as well as an approximation of the total number of such solutions. For a fixed number of variables, the algorithm runs in random polynomial time with parallel complexity poly-logarithmic in d, m and p, using a polynomial number of processors. As an essential step of the algorithm, we also formulate an algebraic homotopy method for extracting components of all dimensions of an algebraic set. The method is efficiently parallelizable.