Ben Lee Volk
Abstract
Hamed Hatami and Pooya Hatami, our guest columnists in this issue, take us to a fascinating tour through communication complexity classes, and their relations to structural properties of Boolean matrices. Thanks a lot to Hamed and Pooya for their contribution!
Coming up on the next issues, we will have columns by Pranjal Dutta and Sumanta Ghosh (on Polynomial identity testing), by Dean Doron (topic TBA), by Stacey Jeffrey (on Quantum Las Vegas Algorithms and Composition) and by Igor Carboni Oliveira (on Complexity Theory in Bounded Arithmetic: Recent Results and Current Frontiers). The future looks promising and exciting.
Index Terms
- SIGACT News Complexity Theory Column 120
Recommendations
SIGACT news complexity theory column 36
This current issue's guest column is by Bill Gasarch, and reports on a poll he has conducted on the most famous open question in complexity theory: P=?NP. If Mitsunori Ogihara's prediction that P-vs-NP will not be resolved until the year 3000 is correct,...
SIGACT News Complexity Theory Column 101
This issue's column brings to a close the half-year of Bill in the Complexity Theorem Column. In particular, the previous issue's Complexity Theory Column was Bill Gasarch's third P versus NP poll, and this issue's column is Bill, Erik, Jacob, and Scott'...
SIGACT News Complexity Theory Column 100
This is column number 100, and Bill Gasarch has very kindly made it an event! In particular, this issue's column is the third of Bill Gasarch's series of polls on the eld's thoughts on P vs. NP (and other central issues in complexity). The rst two polls ...
Comments