A method for obtaining efficient lower bounds for monotone complexity

Algebra and Logic

Volumn 26, Issue 1, 1987, Pages 1-18

  Andreev, A E ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34250088760     PISSN: 00025232     EISSN: 15738302     Source Type: Journal    
DOI: 10.1007/BF01978380     Document Type: Article

References (17)

1. On the minimal contact-valve two-terminal networks for monotone symmetric functions
2. On a certain Boolean matrix
3. On the realization of disjunction and conjunction in certain monotone bases
4. Complexity of monotone networks for Boolean matrix product
5. Monotone switching circuits and Boolean matrix product
6. Some remarks on Boolean sums
7. Switching functions whose monotone complexity is nearly quadratic
8. A monotone Boolean system with quadratic complexity of realization in the basis {&, V, 0, 1}
9. On a method for obtaining lower bounds for the complexity of individual monotone functions
10. Lower bounds for the monotone complexity of certain Boolean functions
11. Lower bounds on the monotone complexity of the logical permanent
12. On the synthesis of certain classes of control systems