ISBN: 9783540403449 - primality testing in polynomial time: from randomized algorithms to "primes is in p" (lecture notes in computer science, 3000, band 3000) (14 Ergebnisse)

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.

Zustand: New.

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

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New. In English.

Zustand: As New. Unread book in perfect condition.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

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

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

kartoniert kartoniert. Zustand: 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.…

PF. Zustand: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Zustand: 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. Zustand: 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.…