Infinite Communication Complexity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2014

Infinite Communication Complexity

Abstract

Suppose that Alice and Bob are given each an infinite string, and they want to decide whether their two strings are in a given relation. How much communication do they need? How can communication be even defined and measured for infinite strings? In this article, we propose a formalism for a notion of infinite communication complexity, prove that it satisfies some natural properties and coincides, for relevant applications, with the classical notion of amortized communication complexity. More-over, an application is given for tackling some conjecture about tilings and multidimensional sofic shifts.
Fichier principal
Vignette du fichier
comm.pdf (200.27 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01108690 , version 1 (23-01-2015)

Identifiers

  • HAL Id : hal-01108690 , version 1

Cite

Pierre Guillon, Emmanuel Jeandel. Infinite Communication Complexity. 2014. ⟨hal-01108690⟩
402 View
131 Download

Share

Gmail Mastodon Facebook X LinkedIn More