Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P": 3000 (Lecture Notes in Computer Science) - Softcover
Inhaltsangabe
A self-contained treatment of theoretically and practically important efficient algorithms for the primality problem. The text covers 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, and it may be used as a supplement for courses or for self-study.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Weitere beliebte Ausgaben desselben Titels
Suchergebnisse für Primality Testing in Polynomial Time: From Randomized...
Beispielbild für diese ISBN
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)
Anbieter: Recycle Bookstore, San Jose, CA, USA
Verkäuferbewertung 4 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 1024313
Beispielbild für diese ISBN
Primality Testing in Polynomial Time: From Randomized Algorithms to "Primes is in P"
Anbieter: Moe's Books, Berkeley, CA, USA
Verkäuferbewertung 4 von 5 Sternen
softcover. Zustand: very good. no jacket. Nearly new. Bestandsnummer des Verkäufers 1137600
Beispielbild für diese ISBN
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)
Anbieter: HPB-Red, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
paperback. Zustand: 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! Bestandsnummer des Verkäufers S_393661091
Foto des Verkäufers
Primality Testing in Polynomial Time : From Randomized Algorithms to "Primes Is in P"
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 2064038-n
Neu kaufen
EUR 53,60
Versand:
EUR 2,28
Innerhalb der USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Primality Testing in Polynomial Time (Paperback)
ISBN 10: 3540403442
ISBN 13: 9783540403449
Neu
Paperback
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9783540403449
Beispielbild für diese ISBN
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020166152
Neu kaufen
EUR 52,67
Versand:
EUR 3,45
Innerhalb der USA
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Primality Testing in Polynomial Time : From Randomized Algorithms to "Primes Is in P"
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 2064038
Gebraucht kaufen
EUR 61,34
Versand:
EUR 2,28
Innerhalb der USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science, 3000)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540403449_new
Neu kaufen
EUR 57,54
Versand:
EUR 13,62
Von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science)
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
Paperback. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783540403449
Neu kaufen
EUR 55,60
Versand:
EUR 17,61
Von Vereinigtes Königreich nach USA
Anzahl: 10 verfügbar
Foto des Verkäufers
Primality Testing in Polynomial Time : From Randomized Algorithms to "Primes Is in P"
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 2064038-n
Neu kaufen
EUR 57,53
Versand:
EUR 17,06
Von Vereinigtes Königreich nach USA
Anzahl: Mehr als 20 verfügbar