<eBook>
17th IEEE Annual Conference on Computational Complexity (CCC 2002)

Creator
Language
Publisher
Year
Place
Abstract Thirty-six papers originally presented at the May 2002 conference sponsored by the IEEE Computer Society cover a range of issues in computational complexity. They look at such topics as hard examples for bounded depth frege, relations between average case complexity and approximation complexity, algorithmic derandomization via complexity theory, randomness conductors and constant-degree lossless expanders, resolution lower bounds for perfect matching principles, information theory methods in communication complexity, and pseudo-random generators and structure of complete degrees. Annotation copyrighted by Book News, Inc., Portland, OR.
View fulltext Full text available from IEEE Proceedings Order Plan (POP) 1998-present

Details

Record ID
SSID
eISBN
Created Date 2017.03.14
Modified Date 2017.11.26