Produkt
KlappentextTo ?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.
Zusammenfassung
Describes the new deterministic polynomial time primality test (Agrawal/Kayal/Saxena) with complete analysis in a consolidated way
Includes supplementary material: sn.pub/extras
Describes the new deterministic polynomial time primality test (Agrawal/Kayal/Saxena) with complete analysis in a consolidated way
Includes supplementary material: sn.pub/extras
Details
ISBN/GTIN978-3-540-40344-9
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2004
Erscheinungsdatum29.06.2004
Seiten150 Seiten
SpracheEnglisch
Gewicht250 g
IllustrationenX, 150 p.
Artikel-Nr.10566840
Rubriken