Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Primality Testing in Polynomial Time

Name: Primality Testing in Polynomial Time
Brand: Springer, Berlin
SKU: 01562724
Price: 19648 HUF
Availability: InStock
Author: Martin Dietzfelbinger
ISBN: 9783540403449

From Randomized Algorithms to "Primes is in P"

Martin Dietzfelbinger

Language

English

Book Paperback

Libristo code: 01562724

Publishers Springer, Berlin, July 2004

This book is devoted to algorithms for the venerable primality problem: Given a natural number n, de... Full description

Libristo code: 01562724

136 b

19 648 Ft

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Über Frauen David Rieff

Paperback

5 544 Ft

Native Kuhn Book

Paperback

25 494 Ft

IR A LA HABANA PADURA

Book

12 170 Ft

Purr

Audio CD

7 118 Ft

Cornelius Torices

Hardback

12 996 Ft

Meinen Weg alleine weitergehen Christine Koenig

Adobe ePub DRM

4 618 Ft

Дивовижний друг. У Долинi Вовкiв Oliver Scherz

binding.

12 776 Ft

Où finit la ville Bon

Paperback

5 211 Ft

Provence remarquable Book

Paperback

6 206 Ft

Francois Boucher Drawings /anglais LAING/ROSENBERG Book

Paperback

32 731 Ft

Bouw jouw Fortuin: Hoe je met simpele stapjes jouw Eigen Fortuin opbouwt Jasmin Hajro

Paperback

4 599 Ft

Dreimal anziehen, weg damit Heike Holdinghausen

Paperback

6 238 Ft

Stanzereitechnik Erich Krabbe

Paperback

22 847 Ft

Bank-Bluten Herbert Müller

Paperback

24 252 Ft

This book is devoted to algorithms for the venerable primality problem: Given a natural number n, decide whether it is prime or composite.The problem is basic in number theory, efficient algorithms that solve it, i.e., algorithms that run in a number of computational steps which is polynomial in the number of digitsneeded to write n, are important for theoretical computer science and for applications in algorithmics and cryptology.This book gives a self-contained account 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 textbook is written for students of computer science, in particular for 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.