Direct Product Results and the GCD Problem, in Old and New Communication Models

13 years 8 months ago

Download www.math.ias.edu

This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:

Itzhak Parnafes, Ran Raz, Avi Wigderson

Real-time Traffic

2-prover Games Model | Algorithms | Communication Complexity Model | STOC 1997 |

claim paper

» A Direct Product Theorem for Discrepancy

» Business Intelligence in Healthcare Organizations

» Timeadaptive quantile regression

» Connected coverage in wireless networks with directional antennas

» Algebrization A New Barrier in Complexity Theory

» Model Transformation Technologies in the Context of Modelling Software Systems

» Concurrent Workflow Evolution

» Boundederror quantum state identification and exponential separations in communication com...

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	STOC
Authors	Itzhak Parnafes, Ran Raz, Avi Wigderson

Comments (0)

Sciweavers

Direct Product Results and the GCD Problem, in Old and New Communication Models

2-prover Games Model | Algorithms | Communication Complexity Model | STOC 1997 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers