Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" - Couverture souple

Dietzfelbinger, Martin

9783540403449: Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P"

Couverture souple

ISBN 10 : 3540403442 ISBN 13 : 9783540403449

Editeur : Springer, 2008

Afficher les exemplaires de cette �dition comportant l?ISBN

5 D'occasion

De EUR 25,07

12 Neuf

De EUR 54,01

A self-contained 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 the recent deterministic algorithm of Agrawal, Kayal, and Saxena. The volume is written for students of computer science, in particular those with a special interest in cryptology, and students of mathematics. The text may be used as a supplement for courses or for self-study.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

� propos de l?auteur

Univ.-Prof. Dr.(USA) Martin Dietzfelbinger (b. 1956) studied Mathematics in Munich and earned his Ph.D. from the University of Illinois at Chicago. In 1992, he obtained his Habilitation at the Universit�t Paderborn with a thesis on randomized algorithms; in the same year he became a professor of computer science at the Universit�t Dortmund. Since 1998, he holds the chair for Complexity Theory and Efficient Algorithms at the Faculty of Computer Science and Automation of the Technische Universit�t Ilmenau, Germany. His main research interests are in complexity theory and data structures.

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: Springer
Date d'�dition: 2008
Langue: anglais
ISBN 10: 3540403442
ISBN 13: 9783540403449
Reliure: Broch�
Nombre de pages: 160
Coordonn�es du fabricant: non disponible
Personne responsable: CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Allemagne

Autres �ditions populaires du m�me titre

9783662174456: Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P"

Edition pr�sent�e

ISBN 10 : 3662174456 ISBN 13 : 9783662174456
Editeur : Springer, 2014
Couverture souple

R�sultats de recherche pour Primality Testing in Polynomial Time: From Randomized...

Image d'archives

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)

Dietzfelbinger, Martin (Author)

Edit� par Springer, 2004

ISBN 10 : 3540403442 ISBN 13 : 9783540403449

Ancien ou d'occasion Paperback

Vendeur : Recycle Bookstore, San Jose, CA, Etats-Unis

�valuation du vendeur 4 sur 5 �toiles

Paperback. Etat : Very Good. Book has faint rubbing to covers, light wear to edges, a small smudge to bottom textblock. otherwise in great condition, strong binding, bright and unmarked pages; an overall sturdy copy with clean interiors. N� de r�f. du vendeur 1024313

Contacter le vendeur

Acheter D'occasion

EUR 25,07

Frais de port : EUR 5,01

Vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Primality Testing in Polynomial Time: From Randomized Algorithms to "Primes is in P"

Martin Dietzfelbinger

Edit� par Springer, 2004

ISBN 10 : 3540403442 ISBN 13 : 9783540403449

Ancien ou d'occasion softcover

Vendeur : Moe's Books, Berkeley, CA, Etats-Unis

�valuation du vendeur 4 sur 5 �toiles

softcover. Etat : very good. no jacket. Nearly new. N� de r�f. du vendeur 1137600

Contacter le vendeur

Acheter D'occasion

EUR 26,90

Frais de port : EUR 5,66

Vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image d'archives

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)

Dietzfelbinger, Martin

Edit� par Springer, 2004

ISBN 10 : 3540403442 ISBN 13 : 9783540403449

Ancien ou d'occasion paperback

Vendeur : HPB-Red, Dallas, TX, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! N� de r�f. du vendeur S_393661091

Contacter le vendeur

Acheter D'occasion

EUR 35,27

Frais de port : EUR 3,27

Vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Primality Testing in Polynomial Time : From Randomized Algorithms to "Primes Is in P"

Dietzfelbinger, Martin

Edit� par Springer, 2004

ISBN 10 : 3540403442 ISBN 13 : 9783540403449

Neuf Couverture souple

Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Etat : New. N� de r�f. du vendeur 2064038-n

Contacter le vendeur

Acheter neuf

EUR 54,01

Frais de port : EUR 2,30

Vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image d'archives

Primality Testing in Polynomial Time (Paperback)

Martin Dietzfelbinger

Edit� par Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2004

ISBN 10 : 3540403442 ISBN 13 : 9783540403449

Neuf Paperback

Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis

�valuation du vendeur 5 sur 5 �toiles

Paperback. Etat : new. Paperback. On August 6, 2002,a paper with the title PRIMES is in P, by M. Agrawal, N. Kayal, and N. Saxena, appeared on the website of the Indian Institute of Technology at Kanpur, India. In this paper it was shown that the primality problemhasadeterministic algorithm that runs in polynomial time. Finding out whether a given number n is a prime or not is a problem that was formulated in ancient times, and has caught the interest of mathema- ciansagainandagainfor centuries. Onlyinthe 20thcentury,with theadvent of cryptographic systems that actually used large prime numbers, did it turn out to be of practical importance to be able to distinguish prime numbers and composite numbers of signi?cant size. Readily, algorithms were provided that solved the problem very e?ciently and satisfactorily for all practical purposes, and provably enjoyed a time bound polynomial in the number of digits needed to write down the input number n. The only drawback of these algorithms is that they use randomization that means the computer that carries out the algorithm performs random experiments, and there is a slight chance that the outcome might be wrong, or that the running time might not be polynomial. To ?nd an algorithmthat gets by without rand- ness, solves the problem error-free, and has polynomial running time had been an eminent open problem in complexity theory for decades when the paper by Agrawal, Kayal, and Saxena hit the web. To ?nd an algorithmthat gets by without rand- ness, solves the problem error-free, and has polynomial running time had been an eminent open problem in complexity theory for decades when the paper by Agrawal, Kayal, and Saxena hit the web. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N� de r�f. du vendeur 9783540403449

Contacter le vendeur