9780769531694
Computational complexity; proceedings.
Annual IEEE Conference on Computational Complexity (23d: 2008:
College Park, Maryland)
Computer Society Press
2008
341 pages
$187.00
Paperback
QA402
This volume consists of 32 papers from the June 2008 conference on
methods developed by computer scientists for studying the performance
and limitations of computer algorithms. Three papers receiving an award
prove the sum of small-bias generators fools polynomials, lower bounds
for constant depth multilinear circuits, and approximate
inclusion-exclusion for arbitrary symmetric functions. Other topics
include hardness amplification within NP deterministic algorithms, a
direct product theorem for discrepancy, black box polynomial identity
testing, and detecting rational points on hypersurfaces over finite
fields. No subject index is provided.
([c]20082005 Book News, Inc., Portland, OR)
COPYRIGHT 2008 Book News, Inc. Reproduced with permission of the copyright holder. Further reproduction or distribution is prohibited without permission.
Copyright 2008 Gale, Cengage Learning. All rights
reserved. Gale Group is a Thomson Corporation Company.
NOTE: All illustrations and photos have been removed from this article.