Tallenna
Primality Testing in Polynomial Time
Kirjailija:
nidottu, 2004
englanti
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.
- Alaotsikko
- From Randomized Algorithms to "PRIMES Is in P"
- Kirjailija
- Martin Dietzfelbinger
- Painos
- 2004 ed.
- ISBN
- 9783540403449
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 29.6.2004
- Sivumäärä
- 150
