Campus Event Calendar: Rahul Jain (07/18/2003 in 46.1

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

A direct sum theorem in communication complexity via message compression.

Rahul Jain

TIFR, Mumbai, India

AG1 Mittagsseminar (own work)

AG 1, AG 2, AG 3, AG 4

AG Audience

-- Not specified --

Note: We use this to send email in the morning.

Date, Time and Location

Friday, 18 July 2003

13:30

45 Minutes

46.1 - MPII

024

Saarbrücken

Abstract

We introduce the model of communication complexity. We study the direct sum problem in this model in which the goal is to study the complexity of computing the answer on many instances of the same problem as compared to the complexity of computing the answer on a single instance.

Contact

Kavitha Telikepalli

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Imprint / Impressum | Data Protection / Datenschutzhinweis