Computational Complexity: Proceedings : Fourteenth Annual IEEE Conference on Computational Complexity : May 4-6, 1999, Atlanta, Georgia, USA

Front Cover
IEEE Computer Society, 1999 - Computers - 241 pages
Six of the 28 papers chosen for presentation and publication were also chosen for the joint STOC/Complexity session, and so are presented in full in that proceedings and only by abstracts here. Only abstracts and references are provided for the two invited talks as well. Among the topics of the full papers are a lower bound for primality, computing from partial solutions, the complexity of solving equations over finite groups, the expected size of Heilbronn's triangles, quantum branded query complexity, deterministic amplification of space-bounded probabilistic undirected graph connectivity, the shortest lattice vector problem, and complicated complementations. No subject index. Annotation copyrighted by Book News, Inc., Portland, OR

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


Pseudorandom Generators without the XOR Lemma
A Lower Bound for Primality
On Monotone Planar Circuits

18 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information