A Note on Non-Deterministic Communication Complexity with Few Witnesses |
| |
| Authors: | Grolmusz and Tardos |
| |
| Affiliation: | (1) Department of Computer Science, E?tv?s University, Budapest, Pázmány P. stny. 1/C, H-1117 Budapest, Hungary grolmusz@cs.elte.hu, HU;(2) Rényi Mathematical Institute of the Hungarian Academy of Science, Reáltanoda u. 13—15, H-1055 Budapest, Hungary tardos@renyi.hu, HU |
| |
| Abstract: | We improve both main results of the paper ``Non-Deterministic Communication Complexity with Few Witnesses ' by M. Karchmer, I. Newman, M. Saks, and A. Wigderson, that appeared in Journal of Computer and System Sciences , Vol. 49, pp. 247—257. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
