1379 search results - page 104 / 276 » The Complexity of the Annihilating Polynomial |
182
click to vote
CONCUR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
133
click to vote
JSC
2008
15 years 6 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 ...
139
click to vote
JSC
2006
15 years 6 months ago
2006
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
143
click to vote
MOC
1998
15 years 6 months ago
1998
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
203
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...