Isbn: 9783540403449 - Primality Testing in Polynomial Time: from Randomized Algorithms to "primes is in P": 3000 (lecture Notes in Computer Science, 3000) (16 results)

Paperback. Condition: Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee.

Paperback. Condition: 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.

Condition: New.

Paperback or Softback. Condition: New. Primality Testing in Polynomial Time: From Randomized Algorithms to Primes Is in P. Book.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: New.

Condition: New.

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 problem'hasa'deterministic 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.…

Paperback. Condition: Very Good. Primality Testing in Polynomial Time This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. .…

paperback. Condition: New. In shrink wrap. Looks like an interesting title.

Softcover. Condition: gut. 2004. Primality Testing in Polynomial Time In deutscher Sprache. pages.

kartoniert kartoniert. Condition: Sehr gut. 147 Seiten, mit Abbildungen, Zust: Gutes Exemplar. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Deutsch Gewicht in Gramm: 252.…

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Describes the new deterministic polynomial time primality test (Agrawal/Kayal/Saxena) with complete analysis in a consolidated wayUniv.-Prof. Dr.(USA) Martin Dietzfelbinger (b. 1956) studied Mathematics in Munich and earned his Ph.D. from the . …

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 164 pp. Englisch.…