Spar
Primality Testing in Polynomial Time
Forfatter:
heftet, 2004
Engelsk
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.
- Undertittel
- From Randomized Algorithms to "PRIMES Is in P"
- Forfatter
- Martin Dietzfelbinger
- Opplag
- 2004 ed.
- ISBN
- 9783540403449
- Språk
- Engelsk
- Vekt
- 310 gram
- Utgivelsesdato
- 29.6.2004
- Antall sider
- 150
