2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/31518We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average-case. We consider total, partial, and partially correct protocols, one-way versus two-way, with and without help bits. The results are expressed in trems of Kolmogorov complexity.11 pages, LaTeXComputational ComplexityDistributed, Parallel, and Cluster ComputingF.1; F.2text