Amanote Research
Register
Sign In
Very Short Primality Proofs
Mathematics of Computation
- United States
doi 10.2307/2007892
Full Text
Open PDF
Abstract
Available in
full text
Categories
Computational Mathematics
Applied Mathematics
Number Theory
Algebra
Date
January 1, 1987
Authors
Carl Pomerance
Publisher
JSTOR
Related search
Two Short Proofs Concerning Tree-Decompositions
Combinatorics Probability and Computing
Statistics
Probability
Applied Mathematics
Mathematics
Computational Theory
Theoretical Computer Science
Short Proofs of the Kneser-Lovász Coloring Principle
Information and Computation
Theoretical Computer Science
Computational Theory
Computer Science Applications
Information Systems
Mathematics
Primality Test
American Journal of Computational Mathematics
Two Short Proofs of the Perfect Forest Theorem
Theory and Applications of Graphs
Combinatorics
Numerical Analysis
Theoretical Computer Science
Discrete Mathematics
Catholicism: A Very Short Introduction
Education: A Very Short Introduction
Choice Reviews Online
Journalism: A Very Short Introduction
On Fast Heuristic Non-Deterministic Algorithms and Short Heuristic Proofs
Fundamenta Informaticae
Information Systems
Algebra
Number Theory
Mathematics
Computational Theory
Theoretical Computer Science
Geoffrey Chaucer: A Very Short Introduction