21st Annual IEEE Conference on Computational Complexity (CCC 2006) 16-20 July 2006/Prague, Czech Republic

Author/creator IEEE Computer Society Staff
Other author IEEE Xplore (Online service)
Format Electronic
Publication InfoLos Alamitos : IEEE Computer Society Press
Description384 p. 11.000 x 08.500 in.
Supplemental ContentFull text available from IEEE Electronic Library (IEL)
Supplemental ContentFull text available from IEEE Conference Proceedings Archive 2005-2009
Supplemental ContentFull text available from IEEE Electronic Library (IEL) Conference Proceedings
Subjects

Summary Annotation This annual conference covers all areas of computational complexity theory and encompasses results from other areas of computer science and mathematics motivated by topics in complexity theory. The 30 papers in CCC 2006 focuses on computational complexity while addressing topics such as complexity classes, algebraic complexity, proof complexity, interactive proof systems, circuits and other concrete computational models. It also examines subjects in Kolmogorov complexity, average case complexity reducibility, communication complexity, complexity and logic, nonapproximability, cryptographic complexity, complexity and learning, quantum computation, and derandomization.
Access restrictionAvailable only to authorized users.
Technical detailsMode of access: World Wide Web
Genre/formElectronic books.
ISBN9780769525969
ISBN0769525962 (Trade Paper) Active Record
Stock numberP2596 00029433

Availability

Library Location Call Number Status Item Actions
Electronic Resources ✔ Available