The monotone circuit complexity of boolean functions-Reference-Cited by-同舟云学术

The monotone circuit complexity of boolean functions

Published:1987-03 Issue:1 Volume:7 Page:1-22
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Alon Noga,Boppana Ravi B.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF02579196.pdf

Reference18 articles.

1. A. V. Aho, J. E. Hopcroft, andJ. D. Ullman,The Design and Analysis of Computer Algorithms, Addison—Wesley, Reading, 1974.

2. A. E. Andreev, On a method for obtaining lower bounds for the complexity of individual monotone functions,Dokl. Ak. Nauk. SSSR 282 (1985), 1033–1037 (in Russian). English translation inSov. Math. Dokl. 31 (1985), 530–534.

3. P. A. Bloniarz,The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph, Ph. D. Dissertation, Technical Report238, Laboratory for Computer Science, Massachusetts Institute of Technology, 1979.

4. N. Blum, A Boolean function requiring 3n network size,Theoretical Computer Science 28 (1984), 337–345.

5. F. Chung andR. M. Karp,in: Open problems proposed at the NSF Conf. on Complexity Theory, Eugene, Oregon 1984,SIGACT News 16 (1984), 46.

Cited by 239 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Shadows of Newton polytopes;Israel Journal of Mathematics;2023-09

2. Sensitivity metrics of complex network based on co-occurrence truth table: exemplified by a high-speed rail network;Journal of Geographical Systems;2023-06-19

3. Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Lower Bounds for Monotone q-Multilinear Boolean Circuits;Lecture Notes in Computer Science;2023

5. Bounds for Approximating Circuits;SpringerBriefs in Mathematics;2023