Hostname: page-component-8448b6f56d-c4f8m Total loading time: 0 Render date: 2024-04-19T06:15:21.580Z Has data issue: false hasContentIssue false
  • English
  • Français

Martin Dietzfelbinger. Primality testing in polynomial time—from randomized algorithms to “PRIMES is in P”. Lecture Notes in Computer Science, vol. 3000. Springer-Verlag, 2004, x + 147 pp.

Published online by Cambridge University Press:  15 January 2014

Charles Rackoff
Charles Rackoff*
Affiliation:
Department of Computer Science, University of Toronto, 10 King's College Road, Toronto Ontario Canada, M5S 3G4. rackoff@cs.toronto.edu.
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
Bulletin of Symbolic Logic , Volume 12 , Issue 3 , September 2006 , pp. 494 - 496
Copyright
Copyright © Association for Symbolic Logic 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)