Computational complexity; proceedings.

9780769537177

Computational complexity; proceedings.

IEEE Conference on Computational Complexity (24th: 2009: Paris, France)

Computer Society Press

2009

387 pages

$194.00

Paperback

QA76.9

Papers from a July 2009 conference highlight current research in computational complexity. Some specific areas examined include the proof complexity of polynomial identities, fixed polynomial size circuit bounds, extractors for low-weight affine sources, Lipschitz continuous ordinary differential equations, and the complexity of Boolean functions in different characteristics. Other subjects covered include planar graph isomorphism in log-space, quantum copy-protection and quantum money, reconstruction of generalized depth-3 arithmetic circuits with bounded top fan-in, worst-case running times for average-case algorithms, and new results in the simultaneous message passing model via information theoretic techniques. There is no subject index.

([c]2009 Book News, Inc., Portland, OR)