Hoppa till sidans huvudinnehåll

Primality Testing in Polynomial Time

From Randomized Algorithms to "PRIMES Is in P"

Häftad, Engelska, 2004

AvMartin Dietzfelbinger

689 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

On August 6, 2002,a paper with the title “PRIMES is in P”, by M. Agrawal, N. Kayal, and N. Saxena, appeared on the website of the Indian Institute of Technology at Kanpur, India. In this paper it was shown that the “primality problem”hasa“deterministic algorithm” that runs in “polynomial time”. Finding out whether a given number n is a prime or not is a problem that was formulated in ancient times, and has caught the interest of mathema- ciansagainandagainfor centuries. Onlyinthe 20thcentury,with theadvent of cryptographic systems that actually used large prime numbers, did it turn out to be of practical importance to be able to distinguish prime numbers and composite numbers of signi?cant size. Readily, algorithms were provided that solved the problem very e?ciently and satisfactorily for all practical purposes, and provably enjoyed a time bound polynomial in the number of digits needed to write down the input number n. The only drawback of these algorithms is that they use “randomization” — that means the computer that carries out the algorithm performs random experiments, and there is a slight chance that the outcome might be wrong, or that the running time might not be polynomial. To ?nd an algorithmthat gets by without rand- ness, solves the problem error-free, and has polynomial running time had been an eminent open problem in complexity theory for decades when the paper by Agrawal, Kayal, and Saxena hit the web.

Produktinformation

  • Utgivningsdatum2004-06-29
  • Mått155 x 233 x 10 mm
  • Vikt260 g
  • FormatHäftad
  • SpråkEngelska
  • SerieLecture Notes in Computer Science
  • Antal sidor150
  • Upplaga2004
  • FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • ISBN9783540403449

Tillhör följande kategorier

Hoppa över listan

Mer från samma författare

Taschenbuch der Algorithmen

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner

Häftad

599 kr

Algorithms Unplugged

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, Berthold Vocking, Rudiger Reischuk

Inbunden

1 529 kr

Algorithms Unplugged

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, Berthold Vocking, Rudiger Reischuk

Häftad

1 509 kr

Hoppa över listan

Mer från samma serie

Del 16095

Energy Informatics

Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin

Häftad

2 089 kr

  • Nyhet

Chromatic Visions

Irina Mihaela Ciortan, Daniele Ferdani, Jon Yngve Hardeberg, Sophia Sotiropoulou, Manuele Veggi

Häftad

569 kr

Hoppa över listan

Du kanske också är intresserad av

Taschenbuch der Algorithmen

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner

Häftad

599 kr

Algorithms Unplugged

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, Berthold Vocking, Rudiger Reischuk

Häftad

1 509 kr

Algorithms Unplugged

Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, Berthold Vocking, Rudiger Reischuk

Inbunden

1 529 kr