Martin Dietzfelbinger
Primality Testing in Polynomial Time: from Randomized Algorithms to 'primes is in P' - Lecture Notes in Computer Science Martin Dietzfelbinger

Name: Primality Testing in Polynomial Time: from Randomized Algorithms to 'primes is in P' - Lecture Notes in Computer Science
Price: 372 CNY
Availability: OutOfStock
Author: Martin Dietzfelbinger

价格

元 372

不含税

远程仓调货

预计送达时间年7月15日 - 年7月27日

顾客评价：

根据欧洲消费者保护法享受14天退换货政策

Trustpilot平台高分认证

添加至iMusic心愿单

Primality Testing in Polynomial Time: from Randomized Algorithms to 'primes is in P' - Lecture Notes in Computer Science

Martin Dietzfelbinger

Written for students of computer science, this volume gives a treatment of theoretically and practically important efficient algorithms for the primality problem, covering the randomized algorithms by Solovay-Strassen and Miller-Rabin from the late 1970s as well as deterministic algorithm of Agrawal, Kayal, and Saxena.

160 pages, biography

介质类型	图书 Paperback Book (平装胶订图书)
已发行	2004年6月29日
原始发行日期	2003
ISBN13	9783540403449
出版商	Springer-Verlag Berlin and Heidelberg Gm
页数	160
商品尺寸	155 × 233 × 8 mm · 249 g
语言	德语