Proceedings 16th Annual IEEE Conference on Computational Complexity [front matter]

fYear

2001

fDate

18-21 June 2001

Abstract

Conference proceedings front matter may contain various advertisements, welcome messages, committee or program information, and other miscellaneous conference information. This may in some cases also include the cover art, table of contents, copyright statements, title-page or half title-pages, blank pages, venue maps or other general information relating to the conference that was part of the original conference proceedings.

Keywords

computational complexity; Boolean functions; Kolmogorov complexity; NP-completeness; VC dimension; affine projections; approximation; communication complexity; computational complexity; computational depth; constrained block coding; counting hierarchy; derandomization; division; entropy; graph tests; independent sets; isomorphisms; learnability; logical operations; lower bounds; monotone simulations; nonlinear secret sharing; nonmonotone proofs; polynomials; product theorems; quantum algorithms; query functions; random formulae; random graphs; resolution; resource-bounded measure; segregators; separators; space complexity; symmetric polynomials; time complexity; traversal sequences; uniform circuits; weak pigeon-hole principle;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Complexity, 16th Annual IEEE Conference on, 2001.

Conference_Location

Chicago, IL, USA

Print_ISBN

0-7695-1053-1

Type

conf

DOI

10.1109/CCC.2001.933864

Filename

933864