Circuit-size lower bounds and non-reducibility to sparse sets

Information and Control

Volumn 55, Issue 1-3, 1982, Pages 40-56

  Kannan, R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0343474117     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(82)90382-5     Document Type: Article

References (34)

1. Two theorems on random polynomial-time
2. On isomorphisms and density of NP and other complete sets
3. 4/3) on the monotone network complexity of nth degree convolution
4. Time and tape bounded Turing acceptors and AFL's
5. On relating time and space to size and depth
6. Alternation
7. The complexity of theorem proving procedures
8. Towards a Complexity Theory of Synchronous Parallel Computation
9. The complexity of negation-limited networks
10. Probabilistic encryption and how to play mental poker keeping secret all partial information
11. On Census Complexity and Sparseness of NP-Complete Sets
12. Upper and lower bounds for first-order expressibility
13. A circuit-size lower bound
14. Some connections between nonuniform and uniform complexity classes
15. Complexity of realization of a linear function in the class of II-circuits
16. The Complexity of Monotone Functions
17. Combinatorial complexity of some monotone functions
18. Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis
19. Monotone switching circuits and Boolean matrix product
20. The equivalence problem for regular expressions with squaring requires exponential space
21. Complexity of monotone networks for Boolean matrix products
22. A 2.5 N-lower bound on the combinatorial complexity of Boolean functions
23. On another Boolean matrix
24. Shifting graphs and their applications
25. The power of negative thinking in multiplying Boolean matrices
26. On uniform circuit complexity
27. Computational work and time on finite machines
28. Zwei lineare untere Schranken fr die Komplexitt Boolescher Funktionen
29. On the combinational complexity of certain symmetric Boolean functions
30. Complexity of monotone networks for computing conjunctions
31. Switching functions whose monotone complexity is nearly quadratic
32. Relativized circuit complexity, preprint
33. Theory and applications of trapdoor functions