{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article7619","name":"Certifying Equality With Limited Interaction","abstract":"The EQUALITY problem is usually one\u2019s first encounter with communication complexity and is one of the most fundamental problems in the field. Although its deterministic and randomized communication complexity were settled decades ago, we find several new things to say about the problem by focusing on three subtle aspects. The first is to consider the expected communication cost (at a worst-case input) for a protocol that uses limited interaction\u2014i.e., a bounded number of rounds of communication\u2014and whose error probability is zero or close to it. The second is to treat the false negative error rate separately from the false positive error rate. The third is to consider the information cost of such protocols. We obtain asymptotically optimal rounds-versus-cost tradeoffs for EQUALITY: both expected communication cost and information cost scale as Theta(log log ... log n), with r-1 logs, where r is the number of rounds. These bounds hold even when the false negative rate approaches 1. For the case of zero-error communication cost, we obtain essentially matching bounds, up to a tiny additive constant. We also provide some applications.","keywords":["equality","communication complexity","information complexity"],"author":[{"@type":"Person","name":"Brody, Joshua","givenName":"Joshua","familyName":"Brody"},{"@type":"Person","name":"Chakrabarti, Amit","givenName":"Amit","familyName":"Chakrabarti"},{"@type":"Person","name":"Kondapally, Ranganath","givenName":"Ranganath","familyName":"Kondapally"},{"@type":"Person","name":"Woodruff, David P.","givenName":"David P.","familyName":"Woodruff"},{"@type":"Person","name":"Yaroslavtsev, Grigory","givenName":"Grigory","familyName":"Yaroslavtsev"}],"position":38,"pageStart":545,"pageEnd":581,"dateCreated":"2014-09-04","datePublished":"2014-09-04","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Brody, Joshua","givenName":"Joshua","familyName":"Brody"},{"@type":"Person","name":"Chakrabarti, Amit","givenName":"Amit","familyName":"Chakrabarti"},{"@type":"Person","name":"Kondapally, Ranganath","givenName":"Ranganath","familyName":"Kondapally"},{"@type":"Person","name":"Woodruff, David P.","givenName":"David P.","familyName":"Woodruff"},{"@type":"Person","name":"Yaroslavtsev, Grigory","givenName":"Grigory","familyName":"Yaroslavtsev"}],"copyrightYear":"2014","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2014.545","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6231","volumeNumber":28,"name":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2014)","dateCreated":"2014-09-04","datePublished":"2014-09-04","editor":[{"@type":"Person","name":"Jansen, Klaus","givenName":"Klaus","familyName":"Jansen"},{"@type":"Person","name":"Rolim, Jos\u00e9","givenName":"Jos\u00e9","familyName":"Rolim"},{"@type":"Person","name":"Devanur, Nikhil R.","givenName":"Nikhil R.","familyName":"Devanur"},{"@type":"Person","name":"Moore, Cristopher","givenName":"Cristopher","familyName":"Moore"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article7619","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6231"}}}