Spara
Primality Testing in Polynomial Time
Författare:
häftad, 2004
Engelska
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.
- Undertitel
- From Randomized Algorithms to "PRIMES Is in P"
- Författare
- Martin Dietzfelbinger
- Upplaga
- 2004 ed.
- ISBN
- 9783540403449
- Språk
- Engelska
- Vikt
- 310 gram
- Utgivningsdatum
- 2004-06-29
- Sidor
- 150
