Digital Sunday See more items on sale
Capa do artigo Primality Testing In Polynomial Time
25% OFF

Primality Testing In Polynomial Time eBook

From Randomized Algorithms To "Primes Is In P"

by Martin Dietzfelbinger
language: english
Publisher: Springer Berlin Heidelberg, August of 2004 ‧
59,61€
47,69€
20% OFF + 5% CARD
IMMEDIATE AVAILABILITY
Ebook for ADE
DIGITAL SUNDAY SEE MORE ITEMS ON SALE
Written for students of computer science, this volume gives a treatment of theoretically and practically important efficient algorithms for the primality problem, covering the randomized algorithms by Solovay-Strassen and Miller-Rabin from the late 1970s as well as deterministic algorithm of Agrawal, Kayal, and Saxena.

Primality Testing In Polynomial Time

From Randomized Algorithms To "Primes Is In P"

by Martin Dietzfelbinger

Property Description
ISBN: 9783540259336
Publisher: Springer Berlin Heidelberg
Release Date: August of 2004
Language: English
Format: eBook
File Format and Compatibility: PDF para ADE
Collection: Lecture Notes In Computer Science
Categories: eBooks in English > Computing > Schedule
EAN: 9783540259336

BOOKS FROM THE SAME COLLECTION

SEE MORE TITLES FROM THIS COLLECTION

MARTIN DIETZFELBINGER

SEE MORE TITLES BY THIS AUTHOR