Bir format seçin:

zip 5.6 Mb indir
rar 7.6 Mb indir
epub 8.7 Mb indir
odf 10.1 Mb indir
djvu 6.1 Mb indir
pdf 8.1 Mb indir

14th Annual IEEE Conference on Computational Complexity: Proceedings : May 4-6, 1999 Atlanta, Georgia, USA: CoCo '99 14th

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 c. Book News, Inc., Portland, OR (booknews.com)

yazar
14th Annual IEEE Conference on Computational Complexity: Proceedings : May 4-6, 1999 Atlanta, Georgia, USA: CoCo '99 14th:
IEEE Conference on Computational Complexity