Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
10.1007/978-3-642-14031-0_8
Saved in:
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference or Workshop Item |
| Published: |
2013
|
| Online Access: | http://scholarbank.nus.edu.sg/handle/10635/41159 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | National University of Singapore |
| id |
sg-nus-scholar.10635-41159 |
|---|---|
| record_format |
dspace |
| spelling |
sg-nus-scholar.10635-411592015-02-25T21:10:53Z Depth-independent lower bounds on the communication complexity of read-once Boolean formulas Jain, R. Klauck, H. Zhang, S. COMPUTER SCIENCE 10.1007/978-3-642-14031-0_8 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6196 LNCS 54-59 2013-07-04T08:20:59Z 2013-07-04T08:20:59Z 2010 Conference Paper Jain, R.,Klauck, H.,Zhang, S. (2010). Depth-independent lower bounds on the communication complexity of read-once Boolean formulas. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6196 LNCS : 54-59. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-14031-0_8" target="_blank">https://doi.org/10.1007/978-3-642-14031-0_8</a> 3642140300 03029743 http://scholarbank.nus.edu.sg/handle/10635/41159 NOT_IN_WOS Scopus |
| institution |
National University of Singapore |
| building |
NUS Library |
| country |
Singapore |
| collection |
ScholarBank@NUS |
| description |
10.1007/978-3-642-14031-0_8 |
| author2 |
COMPUTER SCIENCE |
| author_facet |
COMPUTER SCIENCE Jain, R. Klauck, H. Zhang, S. |
| format |
Conference or Workshop Item |
| author |
Jain, R. Klauck, H. Zhang, S. |
| spellingShingle |
Jain, R. Klauck, H. Zhang, S. Depth-independent lower bounds on the communication complexity of read-once Boolean formulas |
| author_sort |
Jain, R. |
| title |
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas |
| title_short |
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas |
| title_full |
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas |
| title_fullStr |
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas |
| title_full_unstemmed |
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas |
| title_sort |
depth-independent lower bounds on the communication complexity of read-once boolean formulas |
| publishDate |
2013 |
| url |
http://scholarbank.nus.edu.sg/handle/10635/41159 |
| _version_ |
1681082392197988352 |