Two theorems on random polynomial time
- 1 October 1978
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Reducibility, randomness, and intractibility (Abstract)Published by Association for Computing Machinery (ACM) ,1977
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Riemann's Hypothesis and tests for primalityPublished by Association for Computing Machinery (ACM) ,1975
- Computational complexity of probabilistic Turing machinesPublished by Association for Computing Machinery (ACM) ,1974
- Factoring Polynomials Over Large Finite FieldsMathematics of Computation, 1970