On solving hard problems by polynomial-size circuits
- 13 February 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 24 (3) , 171-176
- https://doi.org/10.1016/0020-0190(87)90181-5
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Some Observations about the Randomness of Hard ProblemsSIAM Journal on Computing, 1986
- Bi-immune sets for complexity classesTheory of Computing Systems, 1985
- Hard-core theorems for complexity classesJournal of the ACM, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Circuit-size lower bounds and non-reducibility to sparse setsInformation and Control, 1982
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- On Reducibility to Complex or Sparse SetsJournal of the ACM, 1975
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966
- On the concept of a random sequenceBulletin of the American Mathematical Society, 1940