✦ LIBER ✦

Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

✍ Scribed by Harrison, Gavin; Johnson, Jeremy; Saunders, B. David

Book ID: 121744309
Publisher: Association for Computing Machinery
Year: 2014
Tongue: English
Weight: 667 KB
Volume: 47
Category: Article
ISSN: 1932-2240
DOI: 10.1145/2576802.2576822

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improvement of Rabin's probabilistic

An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)

✍ Jacques Calmet; Rüdiger Loos 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 169 KB

The computational efficiency of a new mi

The computational efficiency of a new minimization algorithm for eigenvalue analysis

✍ M. Geradin 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 849 KB

Error Analysis of Clenshaw's Algorithm f

Error Analysis of Clenshaw's Algorithm for Evaluating Derivatives of a Polynomial

✍ Takemitsu Hasegawa 📂 Article 📅 2001 🏛 Springer Netherlands 🌐 English ⚖ 154 KB

Optimal computation of the Bernstein alg

Optimal computation of the Bernstein algorithm for the bound of an interval polynomial

✍ J. Rokne 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 358 KB

A new probabilistic analysis of Karger's

A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems

✍ Yang Dai; Kazuo Iwano; Naoki Katoh 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 556 KB

Recently Karger proposed a new randomized algorithm for finding a minimum cut of an n-vertex graph (weighted or unweighted) with probability fi (a-'). In this paper we present a new probabilistic analysis of Karger's randomized algorithm for a few classes of unweighted graphs. For random graphs whos

A probabilistic polynomial-time process

A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols

✍ John C. Mitchell; Ajith Ramanathan; Andre Scedrov; Vanessa Teague 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 528 KB