1. Home
  2. Proceedings
  3. CCC
  4. CCC 1999
Default Cover Image

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)

May 4 1999 to May 6 1999

Atlanta, Georgia

ISSN: 1093-0159

ISBN: 0-7695-0075-7

Table of Contents

Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)Freely available from IEEE.pp. iii-iii
PrefaceFreely available from IEEE.pp. viii
Committees and AcknowledgmentsFreely available from IEEE.pp. ix
Ron Book Prize for Best Student PaperFull-text access may be available. Sign in or learn about subscription options.pp. x
Joint STOC/Complexity Session
Short Proofs are Narrow - Resolution Made SimpleFull-text access may be available. Sign in or learn about subscription options.pp. 2
by Eli Ben-Sasson, Avi Wigderson
Joint STOC/Complexity Session
On the Complexity of Diophantine Geometry in Low DimensionsFull-text access may be available. Sign in or learn about subscription options.pp. 3
by J. Maurice Rojas
Joint STOC/Complexity Session
Pseudorandom Generators without the XOR LemmaFull-text access may be available. Sign in or learn about subscription options.pp. 4
by Madhu Sudan, Salil Vadhan, Luca Trevisan
Joint STOC/Complexity Session
Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct PrimesFull-text access may be available. Sign in or learn about subscription options.pp. 5
by Sam Buss, Russell Impagliazzo, Dima Grigoriev, Toniann Pitassi
Joint STOC/Complexity Session
Graph Ramsey Theory and the Polynomial HierarchyFull-text access may be available. Sign in or learn about subscription options.pp. 6
by Marcus Schaefer
Joint STOC/Complexity Session
The Communication Complexity of Pointer Chasing Applications of Entropy and SamplingFull-text access may be available. Sign in or learn about subscription options.pp. 7
by Stephen J. Ponzio, Jaikumar Radhakrishnan, S. Venkatesh
Session 1
A Lower Bound for PrimalityFull-text access may be available. Sign in or learn about subscription options.pp. 10
by Eric Allender, Michael Saks, Igor Shparlinski
Session 1
Non-Automatizability of Bounded-Depth Frege ProofsFull-text access may be available. Sign in or learn about subscription options.pp. 15
by Maria Luisa Bonet, Carlos Domingo, Ricard Gavalda, Alexis Maciel, Toniann Pitassi
Session 1
On Monotone Planar CircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 24
by David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
Session 2
Computing From Partial SolutionsFull-text access may be available. Sign in or learn about subscription options.pp. 34
by Anna Gál, Shai Halevi, Erez Petrank, Richard Lipton
Session 2
Proofs, Codes, and Polynomial-Time ReducibilitiesFull-text access may be available. Sign in or learn about subscription options.pp. 46
by Ravi Kumar, D. Sivakumar
Session 2
Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZKFull-text access may be available. Sign in or learn about subscription options.pp. 54
by Oded Goldreich, Salil Vadhan
Invited Speaker 1
De-Randomizing BPP: The State of the ArtFull-text access may be available. Sign in or learn about subscription options.pp. 76
by Avi Wigderson
Session 3
The Complexity of Solving Equations Over Finite GroupsFull-text access may be available. Sign in or learn about subscription options.pp. 80
by Mikael Goldmann, Alexander Russell
Session 3
Depth-3 Arithmetic Formulae over Fields of Characteristic ZeroFull-text access may be available. Sign in or learn about subscription options.pp. 87
by Amir Shpilka, Avi Wigderson
Session 4
Stronger Separations for Random-Self-Reducibility, Rounds, and AdviceFull-text access may be available. Sign in or learn about subscription options.pp. 98
by László Babai, Sophie Laplante
Session 4
The Expected Size of Heilbronn's TrianglesFull-text access may be available. Sign in or learn about subscription options.pp. 105
by Tao Jiang, Ming Liy, Paul Vitányi
Session 4
Upper Semilattice of Binary Strings with the Relation "x is Simple Conditional to y"Full-text access may be available. Sign in or learn about subscription options.pp. 114
by Andrei Muchnik, Andrei Romashchenko, Nikolai Vereshchagin, Alexander Shen
Session 5
Gaps in Bounded Query HierarchiesFull-text access may be available. Sign in or learn about subscription options.pp. 124
by Richard Beigel
Session 5
Query Order and NP-CompletenessFull-text access may be available. Sign in or learn about subscription options.pp. 142
by Jack J. Dai, Jack H. Lutz
Session 5
Quantum Bounded Query ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 149
by Harry Buhrman, Wilm Van Dam
Invited Speaker 2
Some Recent Progress on the Complexity of Lattice ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 158
by Jin-Yi Cai
Session 6
Quantum Simulations of Classical Random Walks and Undirected Graph ConnectivityFull-text access may be available. Sign in or learn about subscription options.pp. 180
by John Watrous
Session 6
Deterministic Amplification of Space-Bounded Probabilistic AlgorithmsFull-text access may be available. Sign in or learn about subscription options.pp. 188
by Ziv Bar-Yossef, Oded Goldreich, Avi Wigderson
Session 7
A Note on the Shortest Lattice Vector ProblemFull-text access may be available. Sign in or learn about subscription options.pp. 200
by Ravi Kumar, D. Sivakumar
Session 7
Applications of a New Transference Theorem to Ajtai's Connection FactorFull-text access may be available. Sign in or learn about subscription options.pp. 205
by Jin-Yi Cai
Session 7
Learning DNF by Approximating Inclusion-Exclusion FormulaeFull-text access may be available. Sign in or learn about subscription options.pp. 215
by Jun Tarui, Tatsuie Tsukiji
Session 8
Circuit Lower Bounds Collapse Relativized Complexity ClassesFull-text access may be available. Sign in or learn about subscription options.pp. 222
by Richard Beigel, Alexis Maciel
Session 8
Complicated ComplementationsFull-text access may be available. Sign in or learn about subscription options.pp. 227
by Harry Buhrman, Leen Torenvliet
Session 8
The Complexity of k-SATFull-text access may be available. Sign in or learn about subscription options.pp. 237
by Russell Impagliazzo, Ramamohan Paturi
Session 8
Author IndexFreely available from IEEE.pp. 241
Showing 35 out of 35