DocumentCode :
1632191
Title :
Proceedings 17th IEEE Annual Conference on Computational Complexity [front matter]
fYear :
2002
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; algorithmic derandomization; coding problems; computational complexity; concatenated codes; cryptographic hash functions; entanglement-assisted quantum channel; entropy; expanders; hypergraphs; information theory; integer multiplication; lattice problems; learnability; locally decodable codes; nearest-neighbor problems; perfect matching principles; pseudo-random generators; randomness conductors; universal arguments; weak pigeonhole principle;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on
Conference_Location :
Montreal, Quebec, Canada
ISSN :
1093-0159
Print_ISBN :
0-7695-1468-5
Type :
conf
DOI :
10.1109/CCC.2002.1004319
Filename :
1004319
Link To Document :
بازگشت