What is recorded here?
Miller gives deterministic compositeness-witness algorithms and establishes polynomial-bit-length primality testing conditional on the stated Extended Riemann Hypothesis, alongside number-theoretic functional reductions under declared assumptions. To decide whether a huge integer is composite, one can look for a short arithmetic witness instead of trying every possible divisor. Miller combines modular-power checks with bounds on how small such witnesses must be. A fast deterministic guarantee follows under his stated Extended Riemann Hypothesis; a separate unconditional algorithm has a weaker cost. The paper also distinguishes checking a proposed factorization from actually finding it. Later randomized tests and unconditional deterministic tests remove different limitations and remain separate contributions.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
Exact 1976 J. Comput. Deterministic polynomial bit-length primality result assumes source Appendix ERH for stated Dirichlet-character L-functions; unconditional test has a different non-polynomial-bit-length bound. Perfect-power/root/divisor checks and small witnesses remain. Source abstract shorthand and refined theorem bit costs differ; damaged exponent/log glyphs not certified, no guessed exact complexity pasted in. Eulerphi/Carmichael/factorization equivalences and period oracle reductions retain ERH and source reduction/size conditions; recognizable factorization graph is not efficient general factor generation. No resolution of ERH, Pvs NP or factoring. Tiny own modular checks illustrate witnesses, not inherited analytic lemmas/globalproof. No independent scientific certification.
Read the original work
- Miller: conditional efficient deterministic primality testing; exact original journal technical text
- Publisher-deposited exact 1976 journal identity
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Gary L. Miller
Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
Miller: conditional efficient deterministic primality testing
Miller gives deterministic compositeness-witness algorithms and establishes polynomial-bit-length primality testing conditional on the stated Extended Riemann Hypothesis, alongside number-theoretic functional reductions under declared assumptions.
To decide whether a huge integer is composite, one can look for a short arithmetic witness instead of trying every possible divisor. Miller combines modular-power checks with bounds on how small such witnesses must be. A fast deterministic guarantee follows under his stated Extended Riemann Hypothesis; a separate unconditional algorithm has a weaker cost. The paper also distinguishes checking a proposed factorization from actually finding it. Later randomized tests and unconditional deterministic tests remove different limitations and remain separate contributions.
Scientific scope
Exact 1976 J. Comput. Deterministic polynomial bit-length primality result assumes source Appendix ERH for stated Dirichlet-character L-functions; unconditional test has a different non-polynomial-bit-length bound. Perfect-power/root/divisor checks and small witnesses remain. Source abstract shorthand and refined theorem bit costs differ; damaged exponent/log glyphs not certified, no guessed exact complexity pasted in. Eulerphi/Carmichael/factorization equivalences and period oracle reductions retain ERH and source reduction/size conditions; recognizable factorization graph is not efficient general factor generation. No resolution of ERH, Pvs NP or factoring. Tiny own modular checks illustrate witnesses, not inherited analytic lemmas/globalproof. No independent scientific certification.
People and systems
Gary L. Miller