Publisher's Synopsis
Material collected here was presented at an October 2003 symposium. Some subjects discussed are worst-case to average-case reductions for NP problems, algorithms and complexity results for #SAT and Bayesian inference, logics for reasoning about cryptographic constructions, and the cost of cache-oblivious searching. Locally testable cyclic codes, as