Lower bound methods for multiparty communication complexity
| Title: | Lower bound methods for multiparty communication complexity |
| Author: | Ford, Jeffrey Stephen |
| Abstract: | Not available |
| Department: | Computer Sciences |
| Subject: |
Combinatorial analysis
Tensor products Computational complexity |
| URI: | http://hdl.handle.net/2152/2455 |
| Date: | 2006 |
Files in this work
This work appears in the following Collection(s)
-
UT Electronic Theses and Dissertations
ETD is a collection of UT Austin authored electronic dissertations.