73 search results - page 4 / 15 » On the Complexity of Solving a Bivariate Polynomial System |
SIAMJO
2008
13 years 7 months ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
BIRTHDAY
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
JSC
2008
13 years 7 months ago
2008
We describe algorithms for solving a given system of multivariate polynomial equations via the Rational Univariate Reduction (RUR). We compute the RUR from the toric resultant of ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
EUROCRYPT
2009
Springer
14 years 8 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...