Title :
Table of contents
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;
Conference_Titel :
Computational Complexity (CCC), 2013 IEEE Conference on
Conference_Location :
Stanford, CA
