{"title":"Circuit and Communication Complexity","authors":"R. Raz","doi":"10.1090/pcms/010/06","DOIUrl":"https://doi.org/10.1090/pcms/010/06","url":null,"abstract":"There is an interesting connection between communication complexity and the depth of Boolean circuits. In the next lectures, we will explore this connection and we will use it to prove lower bounds for the depth of monotone Boolean circuits. In particular, we will prove a lower bound of Ω(log n) for the monotone depth of directed st-Connectivity and a lower bound of Ω(n) for the monotone depth of Matching.","PeriodicalId":443620,"journal":{"name":"Computational Complexity Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123084954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}