Target New ArrivalsFourth of JulyGift Ideas for DadClothing, Shoes & AccessoriesHome & DecorKitchen & DiningOutdoor Living & GardenGroceryHousehold EssentialsBabyBeautyPersonal CareSports & OutdoorsHealthWellnessLuggageSchool & Office SuppliesToys & GamesElectronicsVideo GamesMovies, Music & BooksParty SuppliesGift IdeasGift CardsPetsUlta Beauty at TargetShop by CommunityTarget OpticalDealsClearanceNew ArrivalsGift Ideas for DadBack to SchoolCollegeTop DealsTarget Circle DealsWeekly AdShop Order PickupShop Same Day DeliveryRegistryRedCardTarget CircleFind Stores
Primality Testing in Polynomial Time - (Lecture Notes in Computer Science) by  Martin Dietzfelbinger (Paperback) - 1 of 1

Primality Testing in Polynomial Time - (Lecture Notes in Computer Science) by Martin Dietzfelbinger (Paperback)

$54.99

In Stock

Free & easy returns

Free & easy returns

Return this item by mail or in store within 90 days for a full refund.
Eligible for registries and wish lists

About this item

Highlights

  • 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.
  • About the Author: Univ.-Prof. Dr.(USA) Martin Dietzfelbinger (b. 1956) studied Mathematics in Munich and earned his Ph.D. from the University of Illinois at Chicago.
  • 150 Pages
  • Computers + Internet, Security
  • Series Name: Lecture Notes in Computer Science

Description



Book Synopsis



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.



Review Quotes




From the reviews:

"This book gives an account of the recent proof by M. Agrawal, N. Kayal and N. Saxena ... that one can decide in polynomial time whether a given natural number is prime or composite. ... It presents the background needed from number theory and algebra to make the proof accessible to undergraduates. ... This concise book is written for students of computer science and of mathematics." (Samuel S. Wagstaff, Mathematical Reviews, Issue 2005 m)

"The book can logically be separated into two parts: the first covering introductory material and the second covering the AKS result itself. ... Chapters ... are a joy to read, and I found the proofs and explanations clear and concise. Amazingly, the material is presented in full, with complete proofs given for all results necessary for proving the main results of the book. ... I would enthusiastically and wholeheartedly recommend this book ... ." (Jonathan Katz, SIGACT News, Vol. 37 (1), 2006)




About the Author



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

Dimensions (Overall): 9.28 Inches (H) x 6.18 Inches (W) x .39 Inches (D)
Weight: .55 Pounds
Suggested Age: 22 Years and Up
Number of Pages: 150
Genre: Computers + Internet
Sub-Genre: Security
Series Title: Lecture Notes in Computer Science
Publisher: Springer
Format: Paperback
Author: Martin Dietzfelbinger
Language: English
Street Date: June 29, 2004
TCIN: 1009227259
UPC: 9783540403449
Item Number (DPCI): 247-24-2299
Origin: Made in the USA or Imported
If the item details aren’t accurate or complete, we want to know about it.

Shipping details

Estimated ship dimensions: 0.39 inches length x 6.18 inches width x 9.28 inches height
Estimated ship weight: 0.55 pounds
We regret that this item cannot be shipped to PO Boxes.
This item cannot be shipped to the following locations: American Samoa (see also separate entry under AS), Guam (see also separate entry under GU), Northern Mariana Islands, Puerto Rico (see also separate entry under PR), United States Minor Outlying Islands, Virgin Islands, U.S., APO/FPO, Alaska, Hawaii

Return details

This item can be returned to any Target store or Target.com.
This item must be returned within 90 days of the date it was purchased in store, delivered to the guest, delivered by a Shipt shopper, or picked up by the guest.
See the return policy for complete information.

Q: How is the content structured in the book?

submitted by AI Shopping Assistant - 7 days ago
  • A: The content is divided into two parts: introductory material and the AKS result, with clear proofs and explanations.

    submitted byAI Shopping Assistant - 7 days ago
    Ai generated

Q: What is the main focus of the book?

submitted by AI Shopping Assistant - 7 days ago
  • A: The main focus is on efficient algorithms for the primality problem, providing both theoretical and practical insights.

    submitted byAI Shopping Assistant - 7 days ago
    Ai generated

Q: What algorithms are covered in this book?

submitted by AI Shopping Assistant - 7 days ago
  • A: The book covers randomized algorithms like Solovay-Strassen and Miller-Rabin, as well as the deterministic algorithm by Agrawal, Kayal, and Saxena.

    submitted byAI Shopping Assistant - 7 days ago
    Ai generated

Q: Who is the target audience for this book?

submitted by AI Shopping Assistant - 7 days ago
  • A: The book is aimed at computer science students, particularly those interested in cryptology, and mathematics students.

    submitted byAI Shopping Assistant - 7 days ago
    Ai generated

Q: What is the author's background?

submitted by AI Shopping Assistant - 7 days ago
  • A: Martin Dietzfelbinger studied Mathematics in Munich and has a Ph.D. from the University of Illinois at Chicago.

    submitted byAI Shopping Assistant - 7 days ago
    Ai generated

Additional product information and recommendations

Discover more options

Frequently bought together

Best-selling Computers & Technology Books

Get top deals, latest trends, and more.

Privacy policy