Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets

@article{Kannan1982CircuitSizeLB,
  title={Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets},
  author={Ravi Kannan},
  journal={Information and Control},
  year={1982},
  volume={55},
  pages={40-56}
}
As remarked in Cook ("Towards a Complexity Theory of Synchronous Parallel Computation," Univ. of Toronto, 1980), a nonlinear lower bound on the circuit-size of a language in P or even in NP is not known. The best known published lower bound seems to be due to Paul ("Proceedings, 7th ACM Symposium on Theory of Computing," 1975). In this paper it is shown first that for each nonnegative integer k there is a language L k in 272 (3 ~r 2 (of the Meyer and Stockmeyer ("Proceedings, 13th IEEE… CONTINUE READING
Highly Influential
This paper has highly influenced 27 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 106 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 34 references

On Isomorphisms and Density of NP and Other Complete Sets

SIAM J. Comput. • 1977
View 6 Excerpts
Highly Influenced

The Complexity of Computing," Wiley, New York

J. E. SAVAGE
1976
View 5 Excerpts
Highly Influenced

The complexity of theorem proving procedures, in "Proceedings

S. A. CooK
3rd ACM Syrup. on Theory of Computing." • 1971
View 5 Excerpts
Highly Influenced

A .Q(n 4/3) oil the monotone network complexity of mh degree convolution, in "Foundations of Computer Science.

N. BLUM
1981
View 5 Excerpts
Highly Influenced

Two theorems on random polynomial time

19th Annual Symposium on Foundations of Computer Science (sfcs 1978) • 1978
View 4 Excerpts
Highly Influenced

Relativized circuit complexity, preprint, Computer Science, Univ. of Toronto

C. B. WZLSON
1983

Theory and application of trapdoor functions

23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) • 1982
View 2 Excerpts

A circuit-size lower bound, in "Proceedings

R. KANZAN
IEEE Symposium on Foundations of Computer Science." • 1981

Similar Papers

Loading similar papers…