DocumentCode
633533
Title
Table of contents
fYear
2013
fDate
5-7 June 2013
Abstract
The following topics are dealt with: computational complexity; random arithmetic; interactive information complexity; monotone circuit complexity; quantum circuits; quantum query complexity; Boolean function; nonadaptive learning graphs; quantum XOR games; directed planar reachability; and multipass graph processing.
Keywords
Boolean functions; circuit complexity; digital arithmetic; learning (artificial intelligence); query processing; reachability analysis; Boolean function; computational complexity; directed planar reachability; monotone circuit complexity; multipass graph processing; nonadaptive learning graphs; quantum XOR games; quantum circuits; quantum query complexity; random arithmetic;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity (CCC), 2013 IEEE Conference on
Conference_Location
Stanford, CA
Type
conf
DOI
10.1109/CCC.2013.4
Filename
6597737
Link To Document