Primality testing in polynomial time—from randomized algorithms to “PRIMES is in P” [Book Review]

Bulletin of Symbolic Logic 12 (3):494-496 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s1079898600002596

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,963

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P".Martin Dietzfelbinger - 2006 - Bulletin of Symbolic Logic 12 (3):494-496.
Max sat approximation beyond the limits of polynomial-time approximation.Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch & Boris Konev - 2001 - Annals of Pure and Applied Logic 113 (1-3):81-94.
The Reliability of Randomized Algorithms.D. Fallis - 2000 - British Journal for the Philosophy of Science 51 (2):255-271.
Probabilistic verification and approximation.Richard Lassaigne & Sylvain Peyronnet - 2008 - Annals of Pure and Applied Logic 152 (1):122-131.
On polynomial time computation over unordered structures.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (3):1093-1125.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
Safe recursion with higher types and BCK-algebra.Martin Hofmann - 2000 - Annals of Pure and Applied Logic 104 (1-3):113-166.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Machines Over the Reals and Non‐Uniformity.Felipe Cucker - 1997 - Mathematical Logic Quarterly 43 (2):143-157.
A polynomial time algorithm for determining Dag equivalence in the presence of latent variables and selection bias.Peter Spirtes - unknown
Polynomial games and determinacy.Tomoyuki Yamakami - 1996 - Annals of Pure and Applied Logic 80 (1):1-16.
A note on Monte Carlo primality tests and algorithmic information theory.Jacob T. Schwartz - unknown
Polynomial Time Uniform Word Problems.Stanley Burris - 1995 - Mathematical Logic Quarterly 41 (2):173-182.
A Simple Observation Regarding Iterations Of Finite-valued Polynomial-time Functions.Jerzy Mycka - 2009 - Reports on Mathematical Logic:19-29.

Analytics

Added to PP
2014-03-18

Downloads
19 (#800,123)

6 months
5 (#640,860)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references