The NP-completeness column: An ongoing guide
- 1 December 1986
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 7 (4) , 584-601
- https://doi.org/10.1016/0196-6774(86)90020-9
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Irreducibility of multivariate polynomialsJournal of Computer and System Sciences, 1985
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- Factorization of multivariate polynomials over finite fieldsMathematics of Computation, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- Fast evaluation of logarithms in fields of characteristic twoIEEE Transactions on Information Theory, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- On Distinguishing Prime Numbers from Composite NumbersAnnals of Mathematics, 1983
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- Factoring Polynomials Over Finite FieldsBell System Technical Journal, 1967