Newsletter   Secure Checkout   View Cart (0 items)  
Search:    Welcome Guest! Save up to 30-40% on most items with our awesome everyday discounts!

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science) [Paperback]

Our Price $ 51.65  
Retail Value $ 54.95  
You Save $ 3.30  
Item Number 231117  
Buy New $51.65
Quantity:
Available on the Internet only.

Item description for Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science) by Martin Dietzfelbinger...

This book is devoted toalgorithms 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 ofdigits needed 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 forthose with a special interest in cryptology, and students of mathematics, and it may be used as a supplement for courses or for self-study.





Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!

Item Specifications...


Pages   147
Est. Packaging Dimensions:   Length: 9.1" Width: 6.1" Height: 0.2"
Weight:   0.55 lbs.
Binding  Softcover
Release Date   Aug 17, 2004
Publisher   Springer
ISBN  3540403442  
ISBN13  9783540403449  


Availability  57 units.
Availability accurate as of May 24, 2017 02:20.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.


More About Martin Dietzfelbinger


Register your artisan biography and upload your photo! 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 UniversitAt Paderborn with a thesis on randomized algorithms; in the same year he became a professor of computer science at the UniversitAt Dortmund. Since 1998, he holds the chair for Complexity Theory and Efficient Algorithms at the Faculty of Computer Science and Automation of the Technische UniversitAt Ilmenau, Germany. His main research interests are in complexity theory and data structures.

Are You The Artisan or Author behind this product?
Improve our customers experience by registering for an Artisan Biography Center Homepage.



Product Categories

1Books > Special Features > New & Used Textbooks > Sciences > Mathematics
2Books > Subjects > Computers & Internet > General
3Books > Subjects > Computers & Internet > Programming > Algorithms > General
4Books > Subjects > Professional & Technical > Engineering > Electrical & Electronics > Electricity Principles
5Books > Subjects > Professional & Technical > Engineering > Electrical & Optical > General
6Books > Subjects > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Number Theory
7Books > Subjects > Science > General
8Books > Subjects > Science > Mathematics > General
9Books > Subjects > Science > Mathematics > Pure Mathematics > Number Theory



Reviews - What do customers think about Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science)?

Be the first to write a review about Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science)



Ask A Question or Provide Feedback regarding Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P" (Lecture Notes in Computer Science)


Item Feedback and Product Questions
For immediate assistance call 888.395.0572 during the hours of 10am thru 8pm EST Monday thru Friday and a customer care representative will be happy to help you!

Help us continuously improve our service by reporting your feedback or questions below:

I have a question regarding this product
The information above is incorrect or conflicting
The page has misspellings or incorrect grammar
The page did not load correctly in my browser or created an error.

Email Address:
Anti Spam Question. To combat spammers we require that you answer a simple question.
What color is the sky?
Leave This Blank :
Do Not Change This Text :



Add This Product Widget To Your Website

Looking to add this information to your own website? Then use our Product Widget to allow you to display product information in a frame that is 120 pixels wide by 240 pixels high.

    Copy and paste the following HTML into your website and enjoy!



Order toll-free weekdays 10am thru 10pm EST by phone: 1-888-395-0572 (Lines are closed on holidays & weekends.)
Customer Service | My Account | Track My Orders | Return Policy | Request Free Catalog | Email Newsletter


Resources
Gift Certificates
RSS Feeds
Corporate
About Us
Contact Us
Policies
Terms Of Use
Privacy Policy