Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Plaisted:1979:FVT,
author = "D. A. Plaisted",
title = "Fast verification, testing, and generation of large
primes",
journal = j-THEOR-COMP-SCI,
volume = "9",
number = "1",
pages = "1--16",
month = jul,
year = "1979",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C5230 (Digital arithmetic methods)",
corpsource = "Dept. of Computer Sci., Univ. of Illinois, Urbana, IL,
USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithm; fast verification; generation; large
primes; number theory; primality; short certificates;
stochastic method; testing",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}