|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
2009 50th Annual IEEE Symposium on Foundations of Computer Science
Table of contents (PDF)
Atlanta, Georgia
October 25-October 27
ISBN: 978-0-7695-3850-1
| ASCII Text | x | ||
| "Table of contents," Foundations of Computer Science, IEEE Annual Symposium on, pp. v-x, 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/FOCS.2009.7, author = {}, title = {Table of contents}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {2009}, issn = {0272-5428}, pages = {v-x}, doi = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2009.7}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Table of contents SN - 0272-5428 SPv EPx PY - 2009 KW - trees (mathematics) KW - approximation theory KW - computational complexity KW - game theory KW - learning systems KW - optimisation KW - polynomials KW - combinatorial algorithms KW - approximation theory KW - random spanning trees KW - local graph partitions KW - multiparty communication complexity KW - instance-optimal geometric algorithms KW - blackbox polynomial identity testing KW - local interaction games KW - statistical query learning KW - optimal long code test KW - universal blind quantum computation KW - bit encryption KW - submodular maximization problems VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2009.7
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.
Index Terms:
trees (mathematics),approximation theory,computational complexity,game theory,learning systems,optimisation,polynomials,combinatorial algorithms,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
Citation:
"Table of contents," focs, pp.v-x, 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Usage of this product signifies your acceptance of the Terms of Use.