Shoping cart:
Empty
Cheap Software
Search by Letter:
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All programs New Mac

Primality Testing in Polynomial Time From Randomized Algorithms to PRIMES Is in P Lecture Notes in Computer Science by Martin Dietzfelbinger PDF eBook

1$
Buy!Download Size: 970.94 KB




English
2008
ISBN: 3540403442, 9783540403449
150 Pages
PDF

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.


Primality Testing in Polynomial Time From Randomized Algorithms to PRIMES Is in P Lecture Notes in Computer Science by Martin Dietzfelbinger PDF eBook

1$
Buy!Download Size: 970.94 KB


Customers who bought this program also bought:




Software Store Deal of the Day

2010 SUPER PACK 4

2010 SUPER PACK 4

Unclude: Adobe Acrobat 9.0 Pro Extended (1 dvd), Adobe Photoshop CS5 Extended 12.0 (1 dvd), Autodesk Autocad LT 2011 (1 dvd), Corel WinDVD Pro 2010 10.0.5.291 Multilingual, CorelDRAW Graphics Suite X5 15.0.0.486, DVD Cloner VII 7.10.992, TechSmith Camtasia Studio 7.0.0

Real PriceSaving Deal of the Day View it »
$2960 94.6%229$BUY!
We recommend
Categories
© 2010-2017. All rights reserved.