230 search results - page 7 / 46 » Faster algorithms for the characteristic polynomial |
COCO
2009
Springer
15 years 1 months ago
2009
Springer
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
ISSAC
1997
Springer
15 years 1 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
ANTS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. For K3 surfaces, we derive some conditions the characteristic polynomial of the Frobenius on the ´etale cohomology must satisfy. These conditions may be used to speed up...
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
STOC
1999
ACM
15 years 1 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...