PublicationsPapers

Trading information complexity for error

Yuval Dagan, Yuval Filmus, Hamed Hatami and Yaqiao Li
CCC 2017, Theory of Computing

We discuss the following general question: How does the information complexity of a function change if we allow non-negligible error?

Our answers have implications to the communication complexity of set disjointness with non-negligible error.

BibTeX

@inproceedings{DFHL2017,
 author = {Yuval Dagan and Yuval Filmus and Hamed Hatami and Yaqiao Li},
 title = {Trading information complexity for error},
 booktitle = {32nd Conference on Computational Complexity (CCC 2017)},
 year = {2017}
}
@article{DFHL2018,
 author = {Yuval Dagan and Yuval Filmus and Hamed Hatami and Yaqiao Li},
 title = {Trading information complexity for error},
 journal = {Theory of Computing},
 volume = {14},
 pages = {6:1--73},
 year = {2018}
}
copy to clipboard