Title :
Table of contents
Abstract :
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.
Keywords :
approximation theory; computational complexity; game theory; learning systems; optimisation; polynomials; trees (mathematics); approximation theory; bit encryption; blackbox polynomial identity testing; combinatorial algorithms; instance-optimal geometric algorithms; local graph partitions; local interaction games; multiparty communication complexity; optimal long code test; random spanning trees; statistical query learning; submodular maximization problems; universal blind quantum computation;
Conference_Titel :
Foundations of Computer Science, 2009. FOCS '09. 50th Annual IEEE Symposium on
Conference_Location :
Atlanta, GA
Print_ISBN :
978-1-4244-5116-6
DOI :
10.1109/FOCS.2009.7
