Computational Complexity

Read the most by: boys and girls

Proceedings of the 12th Annual IEEE Conference on Computational Complexity, Ulm, Germany, 1997 Contains 27 papers from the June conference, plus texts on which survey talks at the conference were based. Some topics include the general notion of a dot-operator, polynomial vicinity circuits and nonlinear lower bounds, complexity and expressive power of logic programming, upper and lower bounds for some depth-3 circuit classes, time bounded frequency computations, communication complexity of the universal relation, and the bottleneck counting argument. No index. Annotation copyrighted by Book News, Inc., Portland, OR.