Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Juni 2004
Genre:	Schulbücher
	Algebra / Algorithm Analysis and Problem Complexity / Algorithms / Algorithms & data structures / C / Coding theory & cryptology / Computation by Abstract Devices / computer science / Computers / Cryptology / Data encryption / Data encryption (Computer science) / Mathematical & statistical software / Mathematical statistics / Maths for computer scientists / Number Theory / Probability and statistics / Probability and Statistics in Computer Science / Theory of Computation mehr...
ISBN:	9783540403449
EAN-Code:	9783540403449
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#3000 - Lecture Notes in Computer Science
Dimensionen:	H 233 mm / B 155 mm / D
Gewicht:	530 gr
Seiten:	150
Illustration:	X, 150 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

A self-contained 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 the recent deterministic algorithm of Agrawal, Kayal, and Saxena. The volume is written for students of computer science, in particular those with a special interest in cryptology, and students of mathematics. The text may be used as a supplement for courses or for self-study.