Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10332020 | Information Processing Letters | 2011 | 6 Pages |
Abstract
⺠A minimum/maximum cut cannot be computed exactly by a one-pass streaming algorithm. ⺠This holds for deterministic and randomized algorithms. ⺠Tools of communication complexity are utilized.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Mariano Zelke,