Communication complexity : a new approach to circuit depth / Mauricio Karchmer.
By: Karchmer, Mauricio [author.]
.
Contributor(s): IEEE Xplore (Online Service) [distributor.] | MIT Press [publisher.].
Material type: 
BookSeries: Acm doctoral dissertation award: Publisher: Cambridge, Massachusetts : MIT Press, c1989Distributor: [Piscataqay, New Jersey] : IEEE Xplore, [1989]Description: 1 PDF (68 pages).Content type: text Media type: electronic Carrier type: online resourceISBN: 9780262256490.Subject(s): Algebra, Boolean | Logic circuits | Computational complexity | Automatic theorem provingGenre/Form: Electronic books.Additional physical formats: Print version:: No titleDDC classification: 511.3/24 Online resources: Abstract with links to resource Also available in print.Dissertation note: Thesis (doctoral)--Hebrew University, 1988. Summary: Communication Complexity describes a new intuitive model for studying circuit networks that captures the essence of circuit depth. Although the complexity of boolean functions has been studied for almost 4 decades, the main problems the inability to show a separation of any two classes, or to obtain nontrivial lower bounds remain unsolved. The communication complexity approach provides clues as to where to took for the heart of complexity and also sheds light on how to get around the difficulty of proving lower bounds.Karchmer's approach looks at a computation device as one that separates the words of a language from the non-words. It views computation in a top down fashion, making explicit the idea that flow of information is a crucial term for understanding computation. Within this new setting, Communication Complexity gives simpler proofs to old results and demonstrates the usefulness of the approach by presenting a depth lower bound for st-connectivity. Karchmer concludes by proposing open problems which point toward proving a general depth lower bound.Mauricio Karchmer received his doctorate from Hebrew University and is currently a Postdoctoral Fellow at the University of Toronto. Communication Complexity received the 1988 ACM Doctoral Dissertation Award.
Thesis (doctoral)--Hebrew University, 1988.
Includes bibliographical references (p. )[65]-66.
Restricted to subscribers or individual electronic text purchasers.
Communication Complexity describes a new intuitive model for studying circuit networks that captures the essence of circuit depth. Although the complexity of boolean functions has been studied for almost 4 decades, the main problems the inability to show a separation of any two classes, or to obtain nontrivial lower bounds remain unsolved. The communication complexity approach provides clues as to where to took for the heart of complexity and also sheds light on how to get around the difficulty of proving lower bounds.Karchmer's approach looks at a computation device as one that separates the words of a language from the non-words. It views computation in a top down fashion, making explicit the idea that flow of information is a crucial term for understanding computation. Within this new setting, Communication Complexity gives simpler proofs to old results and demonstrates the usefulness of the approach by presenting a depth lower bound for st-connectivity. Karchmer concludes by proposing open problems which point toward proving a general depth lower bound.Mauricio Karchmer received his doctorate from Hebrew University and is currently a Postdoctoral Fellow at the University of Toronto. Communication Complexity received the 1988 ACM Doctoral Dissertation Award.
Also available in print.
Mode of access: World Wide Web
Description based on PDF viewed 12/29/2015.
There are no comments for this item.