Printer Friendly

Computational complexity; proceedings.


Computational complexity; proceedings.

Annual IEEE Conference on Computational Complexity (23d: 2008: College Park, Maryland)

Computer Society Press


341 pages




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.
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2008 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Publication:SciTech Book News
Article Type:Book review
Date:Sep 1, 2008
Previous Article:Program comprehension; proceedings.
Next Article:Logic in computer science; proceedings.

Related Articles
Computational complexity; proceedings.
Computational systems bioinformatics; proceedings.
Computational methods and experimental measurements XII; proceedings.
Structural Studies, Repairs and Maintenance of Heritage Architecture IX; proceedings.
Bayesian inference and maximum entropy methods in science and engineering; proceedings.
Computational Complexity: Proceedings.
Trends and perspectives in modern computational science; proceedings.
Finite fields and applications; proceedings.
Temporal representation and reasoning; proceedings.
Logic in computer science; proceedings.

Terms of use | Privacy policy | Copyright © 2021 Farlex, Inc. | Feedback | For webmasters |