About: Towards a reverse Newman's theorem in interactive information complexity

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Towards a reverse Newman's theorem in interactive information complexity Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Newman's theorem states that we can take any public-coin communication protocol and convert it into one that uses only private randomness with only a little increase in communication complexity. We consider a reversed scenario in the context of information complexity: can we take a protocol that uses private randomness and convert it into one that only uses public randomness while preserving the information revealed to each player? We prove that the answer is yes, at least for protocols that use a bounded number of rounds. As an application, we prove new direct sum theorems through the compression of interactive communication in the bounded-round setting. Furthermore, we show that if a Reverse Newman's Theorem can be proven in full generality, then full compression of interactive communication and fully-general direct-sum theorems will result. Newman's theorem states that we can take any public-coin communication protocol and convert it into one that uses only private randomness with only a little increase in communication complexity. We consider a reversed scenario in the context of information complexity: can we take a protocol that uses private randomness and convert it into one that only uses public randomness while preserving the information revealed to each player? We prove that the answer is yes, at least for protocols that use a bounded number of rounds. As an application, we prove new direct sum theorems through the compression of interactive communication in the bounded-round setting. Furthermore, we show that if a Reverse Newman's Theorem can be proven in full generality, then full compression of interactive communication and fully-general direct-sum theorems will result. (en)
Title	Towards a reverse Newman's theorem in interactive information complexity Towards a reverse Newman's theorem in interactive information complexity (en)
skos:prefLabel	Towards a reverse Newman's theorem in interactive information complexity Towards a reverse Newman's theorem in interactive information complexity (en)
skos:notation	RIV/67985840:_____/13:00422288!RIV14-GA0-67985840
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GBP202/12/G061), P(IAA100190902)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Koucký, Michal
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Matematický ústav AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	111343
http://linked.open...ai/riv/idVysledku	RIV/67985840:_____/13:00422288
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	comlexity theory; communication complexity; interactive information complexity (en)
http://linked.open.../riv/klicoveSlovo	communication complexity comlexity theory interactive information complexity
http://linked.open...ontrolniKodProRIV	[E804C5B4D850]
http://linked.open...v/mistoKonaniAkce	Palo Alto
http://linked.open...i/riv/mistoVydani	Washington
http://linked.open...i/riv/nazevZdroje	IEEE Conference on Computational Complexity 2013
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	6 (xsd:int)
http://linked.open...vavai/riv/projekt	Center of excellence - Institute for theoretical computer science (CE-ITI) Mathematical logic, complexity, and algorithms
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Koucký, Michal Brody, J. Buhrman, H. Loff, B. Speelman, F. Vereshchagin, N. K.
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-06-05 (xsd:date)
number of pages	10 (xsd:int)
http://bibframe.org/vocab/doi	10.1109/CCC.2013.12
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4673-6466-9

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software