Higher lower bounds on monotone size

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 378-387

  Harnik, Danny ^a   Raz, Ran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

A-MONOTONE; APPROXIMATORS; INDEPENDENT RANDOM VARIABLES; INPUT VARIABLES; LOWER BOUNDS; PROBABILITY SPACES; SWITCHING LEMMA;

SWITCHING FUNCTIONS; APPROXIMATION THEORY; PROBABILITY; RANDOM PROCESSES;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY;

MONOTONE SWITCHING LEMMA;

EID: 0033718007     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335349     Document Type: Conference Paper

References (21)

1. 1 Formulae on finite structures, Annals of Pure and Applied Logic 24 (1983), pp. 1-48.
2. N. ALON, L. BABAI AND A. ITAI, A fast simple randomized parallel algorithm for the Maximal Independent Set problem, J. of Algorithms 7 (1986), pp. 567-583.
3. N. ALON AND R. BOPPANA, The monotone circuit complexity of Boolean functions, Combinatorica 7(1) (1987), pp. 1-22.
4. K. AMANO AND A. MARUOKA, Potential of the approximation method, Proc. of the 37th IEEE Symp. on the Foundations of Computer Science (1996), pp. 431-440.
5. A. ANDREEV, On a method for obtaining lower bounds for the complexity of individual monotone functions, Dolk. Akad. Nauk. SSSR 282(5) (1985), pp. 1033-1037 (in Russian)
6. English translation in: Soviet Math. Dokl. 31(3) (1985), pp. 530-534.
7. C. BERG AND S. ULFBERG, Symmetric approximation arguments for monotone lower bounds without sunflowers, To appear in: Computational Complexity.
8. C. BERG, S. ULFBERG AND A. WIGDERSON, Manuscript in preparation.
9. R. BOPPANA AND M. SIPSER, The complexity of finite functions,in Handbook of Theoretical Computer Science: Volume A Algorithms and Complexity, J. van Leeuwen editor, MIT Press/Elsevier, 1990, pp. 757-804.
10. G. EVEN, O. GOLDREICH, M. LUBY, N. NISAN AND B. VELICKOVIC, Approximations of general independent distributions, Proc. of the 24th ACM Symp. on the Theory of Computing (1992), pp. 10-16.
11. M. FURST, J. SAXE AND M. SIPSER, Parity, circuits and the polynomial time hierarchy, Proc. of the 22th IEEE Symp. on the Foundations of Computer Science (1981), pp. 260-270.
12. J. HASTAD, Almost optimal lower bounds for small depth circuits, Proc. of the 18th ACM Symp. on the Theory of Computing (1986), pp. 6-20.
13. Also in Randomness and Computation, Advances in Computing Research, Vol 5, ed. S. Micali, JAI Press Inc (1989), pp. 143-170.
14. A. HAKEN, Counting bottlenecks to show monotone P≠NP, Proc. of the 36th IEEE Symp. on the Foundations of Computer Science (1995), pp. 36-40.
15. S. JUKNA, Finite limits and monotone computations: the lower bound criterion, Proc. of the 12th IEEE Conference on Computational Complexity (1997), pp. 302-312.
16. P. PUDLAK, Lower bounds for resolution and cutting planes proofs and monotone computation, The Journal of Symbolic Logic, 62(3) (1997), pp. 981-998.
17. A. RAZBOROV, Lower bounds on the monotone complexity of some Boolean function, Dolk. Akad. Nauk. SSSR 281(4) (1985), 598-607 (in Russian).
18. English translation in: Soviet Math. Dokl. 31 (1985), 354-357.
19. A. RAZBOROV, On the method of approximation, Proc. of the 21th ACM Symp. on the Theory of Computing (1989), pp. 167-176.
20. J. SIMON AND S.C. TSAI, A note on the bottleneck counting argument, In 12th Annual IEEE Conference on Computational Complexity (1997).
21. A. YAO, Separating the polynomial-time hierarchy by oracles, Proc. of the 26th IEEE Symp. on the Foundations of Computer Science (1985), pp. 1-10.