𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pseudoirreducible Polynomials: Probabilistic Irreducibility Testing

✍ Scribed by L. V. Kovalchuk

Book ID
111576088
Publisher
Springer US
Year
2004
Tongue
English
Weight
94 KB
Volume
40
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Analysis of Ben-Or's polynomial irreduci
Analysis of Ben-Or's polynomial irreducibility test
✍ Daniel Panario; Bruce Richmond πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 235 KB

We give a precise average-case analysis of Ben-Or's algorithm for testing the irreducibility of polynomials over finite fields. First, we study the probability that a random polynomial of degree n over ‫ކ‬ contains no irreducible factors of degree less than m, q 1 F m F n. The results are given in t

Testing shift-equivalence of polynomials
Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines
✍ D. Grigoriev πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 930 KB

The polynomials f, g E F[Xl, ,X,J are called shift-equivalent if there exists a shift (a~, , cc,) E F" such that f(Xl furl, . . ,X,, + CC,) = g. In three different cases algorithms which produce the set of all shift-equivalences of f, g in polynomial time are designed. Here (1) in the case of a zero

A Probabilistic Algorithm to Test Local
A Probabilistic Algorithm to Test Local Algebraic Observability in Polynomial Time
✍ Alexandre Sedoglavic πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 395 KB

The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the input-output behaviour of an experiment? How many of the remaining variables should we assume to be known in order to determ