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

Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247)

June 15 1998 to June 18 1998

Buffalo, New York

ISSN: 1093-0159

ISBN: 0-8186-8395-3

Table of Contents

Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247)Freely available from IEEE.pp. i-i
Committees and AcknowledgementsFreely available from IEEE.pp. viii
Best Student Paper AwardFreely available from IEEE.pp. ix
Session 1
On Membership Comparable SetsFull-text access may be available. Sign in or learn about subscription options.pp. 2
by D. Sivakumar
Session 1
Nonrelativizing SeparationsFull-text access may be available. Sign in or learn about subscription options.pp. 8
by H. Buhrman, L. Fortnow, T. Thierauf
Session 1
Two QueriesFull-text access may be available. Sign in or learn about subscription options.pp. 13
by H. Buhrman, L. Fortnow
Computational indistinguishability: a sample hierarchyFull-text access may be available. Sign in or learn about subscription options.pp. 24-33
by O. Goldreich, M. Sudan
Session 2
Proofs of Membership vs. Proofs of KnowledgeFull-text access may be available. Sign in or learn about subscription options.pp. 34
by G. Di Crescenzo, R. Impagliazzo
Session 2
Approximating the SVP to within a Factor is NP-Hard under Randomized ReductionsFull-text access may be available. Sign in or learn about subscription options.pp. 46
by J.-Y. Cai, A. Nerurkar
Session 3
Arthur-Merlin Games in Boolean Decision TreesFull-text access may be available. Sign in or learn about subscription options.pp. 58
by R. Raz, G. Tardos, O. Verbitsky, N. Vereshagin
Session 3
On Arithmetic Branching ProgramsFull-text access may be available. Sign in or learn about subscription options.pp. 68
by A. Beimel, A. Gál
Session 3
The Satisfiability Problem for Probabilistic Ordered Branching ProgramsFull-text access may be available. Sign in or learn about subscription options.pp. 81
by M. Agrawal, T. Thierauf
Session 4
Isolation, Matching, and CountingFull-text access may be available. Sign in or learn about subscription options.pp. 92
by E. Allender, K. Reinhardt
Session 4
A Note on the Hardness of Tree IsomorphismFull-text access may be available. Sign in or learn about subscription options.pp. 101
by P. McKenzie B. Jenne, J. Torán
Session 4
Theory of Periodically Specified Problems: Complexity and ApproximabilityFull-text access may be available. Sign in or learn about subscription options.pp. 106
by M.V. Marathe, H.B. Hunt Iii, D.J. Rosenkrantz, R.E. Stearns
Survey Talk 2
Models of Computation in Coding TheoryFull-text access may be available. Sign in or learn about subscription options.pp. 120
by D.A. Spielman
Session 5
How to Encode a Logical Structure by an OBDDFull-text access may be available. Sign in or learn about subscription options.pp. 122
by H. Veith
Session 5
Complete Problems for Promise Classes by Optimal Proof Systems for Test SetsFull-text access may be available. Sign in or learn about subscription options.pp. 132
by J. Köbler, J. Messner
Session 5
Lower Bounds for Computation with Limited NondeterminismFull-text access may be available. Sign in or learn about subscription options.pp. 141
by H. Klauck
Survey Talk 3
Solving Intractable Problems with DNA ComputingFull-text access may be available. Sign in or learn about subscription options.pp. 154
by R. Beigel, B. Fu
Session 6
Hard Sets are Hard to FindFull-text access may be available. Sign in or learn about subscription options.pp. 170
by H. Buhrman, D. Van Melkebeek
Session 6
On the Resource Bounded Measure of P/polyFull-text access may be available. Sign in or learn about subscription options.pp. 182
by J. Köbler, W. Lindner
Session 6
Probabilistic Martingales and BPTIME ClassesFull-text access may be available. Sign in or learn about subscription options.pp. 186
by K.W. Regan, D. Sivakumar
Session 7
Complexity Limitations on Quantum ComputationFull-text access may be available. Sign in or learn about subscription options.pp. 202
by L. Fortnow, J. Rogers
Session 7
Relationships Between Quantum and Classical Space-Bounded Complexity ClassesFull-text access may be available. Sign in or learn about subscription options.pp. 210
by J. Watrous
Session 7
Uniformly Hard LanguagesFull-text access may be available. Sign in or learn about subscription options.pp. 228
by R. Downey, L. Fortnow
Session 8
Resource-Bounded MeasureFull-text access may be available. Sign in or learn about subscription options.pp. 236
by J.H. Lutz
Session 8
Randomness is HardFull-text access may be available. Sign in or learn about subscription options.pp. 249
by H. Buhrman, L. Torenvliet
Session 8
Resource Bounded Measure and LearnabilityFull-text access may be available. Sign in or learn about subscription options.pp. 261
by W. Lindner, R. Schuler, O. Watanabe
Survey Talk 4
Complexity Issues in Markov Decision ProcessesFull-text access may be available. Sign in or learn about subscription options.pp. 272
by J. Goldsmith, M. Mundhenk
Survey Talk 4
Author IndexFreely available from IEEE.pp. 281
Showing 31 out of 31