Primality testing in polynomial time : from randomized algorithms to "primes" is in P Martin Dietzfelbinger

By:

Publication details: Berlin Springer 2004Edition: 1st edDescription: x, 147 p. ; 24 cmISBN:

ISSN:

Subject(s):

DDC classification:

Item type: Books

Tags from this library: No tags from this library for this title.

Average rating: 0.0 (0 votes)

Holdings
Current library	Call number	Status	Date due	Barcode
Anna Centenary Library	512.542 DIE (Browse shelf(Opens below))	Available		211256

Previous								Next
Previous	512.52 PUR Fundamentals of linear systems for physical scientists and engineers	512.52 SHA Matrix methods and vector spaces in physics	512.53 JAM The representation theory of the Symmetric group	512.542 DIE Primality testing in polynomial time : from randomized algorithms to "primes" is in P	512.55 Categories of symmetries and infinite-dimensional groups	512.55 Foundations of quantum group theory	512.55 ABE Hopf algebras	Next

Includes bibliographical references (p. [143]-144) and index

There are no comments on this title.

to post a comment.

Find us on the map