1380 search results - page 52 / 276 » A General Polynomial Sieve |
STOC
2007
ACM
14 years 9 months ago
2007
ACM
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
Shirayanagi and Sweedler proved that a large class of algorithms over the reals can be modified slightly so that they also work correctly on fixed-precision floating-point numb...
STACS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
ISSAC
2005
Springer
14 years 2 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
ASPDAC
2007
ACM
14 years 22 days ago
2007
ACM
Abstract-- This paper describes the stochastic model order reduction algorithm via stochastic Hermite Polynomials from the practical implementation perspective. Comparing with exis...