33 search results - page 4 / 7 » Algorithms for Modular Counting of Roots of Multivariate Pol... |
COCO
2008
Springer
13 years 8 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
COMPGEOM
1997
ACM
13 years 11 months ago
1997
ACM
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
RSA
2008
13 years 6 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...