By Topic

Table of contents

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.

The following topics are dealt with: approximation theory; random spanning trees; local graph partitions; multiparty communication complexity; instance-optimal geometric algorithms; blackbox polynomial identity testing; local interaction games; statistical query learning; optimal long code test; universal blind quantum computation; bit encryption; submodular maximization problems and combinatorial algorithms.

Published in:

Foundations of Computer Science, 2009. FOCS '09. 50th Annual IEEE Symposium on

Date of Conference:

25-27 Oct. 2009