<電子ブック>
17th IEEE Annual Conference on Computational Complexity (CCC 2002)

著者
本文言語
出版者
出版年
出版地
概要 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.
本文を見る Full text available from IEEE Proceedings Order Plan (POP) 1998-present

詳細

レコードID
SSID
eISBN
登録日 2017.03.14
更新日 2017.11.26