Fast Probabilistic Algorithms for Verification of Polynomial Identities J. T. SCHWARTZ New York Umverszty, New York, New York ABSTRACT T h e starthng success o f the R a b m - S t r a s s e n - S o l o v a y p n m a h t - Irreducibility - Document - PDFSEARCH.IO

First Page	Meta Content
$Abstract algebra / Resultant / Partial fraction / Factorization of polynomials over a finite field and irreducibility tests / Mathematics / Algebra / Polynomials$	Fast Probabilistic Algorithms for Verification of Polynomial Identities J. T. SCHWARTZ New York Umverszty, New York, New York ABSTRACT T h e starthng success o f the R a b m - S t r a s s e n - S o l o v a y p n m a h t Add to Reading List Document Date: 2014-03-05 10:08:30 Open Document File Size: 1,08 MB Share Result on Facebook City New York / / Company Co C1 0 Co / / Currency pence / USD / / IndustryTerm probabilistic algorithms / resultant calculation algorithm / log2n algorithm / successive resultant systems / / Organization U.S. Securities and Exchange Commission / Computer Sctence Department / / Person Rabin / / Position specificperratsslon Author / / ProvinceOrState New York / / Technology following resultant calculation algorithm / log2n algorithm / Rabin-Strassen-Solovay algorithm / / SocialTag Abstract algebra Resultant Partial fraction Factorization of polynomials over a finite field and irreducibility tests Mathematics Algebra Polynomials

Fast Probabilistic Algorithms for Verification of Polynomial Identities J. T. SCHWARTZ New York Umverszty, New York, New York ABSTRACT T h e starthng success o f the R a b m - S t r a s s e n - S o l o v a y p n m a h t Add to Reading List