Monotone circuits for connectivity require super-logarithmic depth

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1988, Pages 539-550

  Karchmer, Mauricio ^a   Wigderson, Avi ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

LOWER BOUNDS; MONOTONE CIRCUIT; MONOTONE FORMULAS; UNDIRECTED GRAPH;

COMPUTATION THEORY;

EID: 46949094917     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/62212.62265     Document Type: Conference Paper

References (0)