Monotone Circuits for Connectivity Require Super-Logarithmic Depth 论文

1990SIAM Journal on Discrete Mathematics引用 286
DOI
Complexity and Algorithms in GraphsAdvanced Graph Theory ResearchOptimization and Search Problems
Optimization and Search ProblemsAdvanced Graph Theory ResearchComplexity and Algorithms in Graphs
相关技术:Optimization and Search ProblemsComplexity and Algorithms in Graphs
关系图谱

Monotone Circuits for Connectivity Require Super-Logarithmic Depth · 作者

阿

阿维·威格德森

M

Mauricio Karchmer