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

Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)

May 24 1996 to May 27 1996

Philadelphia, PA

ISBN: 0-8186-7386-9

Table of Contents

Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)Freely available from IEEE.pp. i-i
ForewordFreely available from IEEE.pp. viii
Committees and AcknowledgmentsFreely available from IEEE.pp. ix
Best Student Paper AwardFreely available from IEEE.pp. x
Session 1—Chair: Birgit Jenner
An Isomorphism Theorem for Circuit ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 2
by Manindra Agrawal, Eric Allender
Session 1—Chair: Birgit Jenner
Nondeterministic NC1 ComputationFull-text access may be available. Sign in or learn about subscription options.pp. 12
by Herve Caussinus, Pierre McKenzie, Denis Therien, Heribert Vollmer
Session 2—Chair: Mitsunori Ogihara
Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform CircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 24
by Chuzo Iwamoto, Kazuo Iwama
Session 2—Chair: Mitsunori Ogihara
Collapsing Oracle-Tape HierarchiesFull-text access may be available. Sign in or learn about subscription options.pp. 33
by Georg Gottlob
Session 3—Chair: David Zuckerman
Extracting Randomness: How and Why - A surveyFull-text access may be available. Sign in or learn about subscription options.pp. 44
by Noam Nisan
Session 3—Chair: David Zuckerman
On Coherence, Random-Self-Reducibility, and Self-CorrectionFull-text access may be available. Sign in or learn about subscription options.pp. 59
by Joan Feigenbaum
Session 4—Chair: Carsten Lund
Error Reduction by Parallel Repetition - A Negative ResultFull-text access may be available. Sign in or learn about subscription options.pp. 70
by Uriel Feige, Oleg Verbitsky
Session 4—Chair: Carsten Lund
Deciding The Vapnik-Chervonenkis Dimension Is Sigma_3-CompleteFull-text access may be available. Sign in or learn about subscription options.pp. 77
by Marcus Schaefer
Session 4—Chair: Carsten Lund
VC Dimension in Circuit ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 81
by Pascal Koiran
Session 5—Chair: Jin-Yi-Cai
Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to LFull-text access may be available. Sign in or learn about subscription options.pp. 88
by Dieter Van Melkebeek
Session 5—Chair: Jin-Yi-Cai
L-Printable SetsFull-text access may be available. Sign in or learn about subscription options.pp. 97
by Lance Fortnow, Judy Goldsmith, Matthew A. Levy, Stephen Mahaney
Session 6—Chair: Luc Lonpre
Hierarchies of Circuit Classes that are Closed Under ComplementFull-text access may be available. Sign in or learn about subscription options.pp. 108
by V Vinay
Session 6—Chair: Luc Lonpre
Succinct Representation, Leaf Languages, and Projection ReductionsFull-text access may be available. Sign in or learn about subscription options.pp. 118
by Helmut Veith
Session 7—Chair: Jin-Yi-Cai
Randomization and Derandomization in Space-Bounded ComputationFull-text access may be available. Sign in or learn about subscription options.pp. 128
by Michael Saks
Session 7—Chair: Jin-Yi-Cai
On The Measure Of Two-Dimensional Regions With Polynomial-Time Computable BoundariesFull-text access may be available. Sign in or learn about subscription options.pp. 150
by Ker-I Ko, K. Weihrauch
Session 9—Chair: Jack Lutz
On Positive PFull-text access may be available. Sign in or learn about subscription options.pp. 162
by Clemens Lautemann, Thomas Schwentick, Iain A. Stewart
Session 9—Chair: Jack Lutz
A Comparison of Weak Completeness NotionsFull-text access may be available. Sign in or learn about subscription options.pp. 171
by Klaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng
Session 10—Chair: Jack Lutz
The Law of the Iterated Logarithm for p-Random SequencesFull-text access may be available. Sign in or learn about subscription options.pp. 180
by Yongge Wang
Session 10—Chair: Jack Lutz
Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXPFull-text access may be available. Sign in or learn about subscription options.pp. 190
by Rainer Schuler
Session 11—Chair: Mitsunori Ogihara
Much Ado about FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 198
by Alan L. Selman
Session 11—Chair: Mitsunori Ogihara
Inverting Onto FunctionsFull-text access may be available. Sign in or learn about subscription options.pp. 213
by Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
Session 12—Chair: Jie Wang
A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NPFull-text access may be available. Sign in or learn about subscription options.pp. 224
by Ashish V. Naik, Alan L. Selman
Session 12—Chair: Jie Wang
Good Degree Lower Bounds on Nullstellensatz Refutations of the Induction PrincipleFull-text access may be available. Sign in or learn about subscription options.pp. 233
by Samuel R. Buss, Toniann Pitassi
Session 13—Chair: Kevin Compton
The complexity of knowledge representationFull-text access may be available. Sign in or learn about subscription options.pp. 244
by C.H. Papadimitriou
Session 13—Chair: Kevin Compton
Integer Programming as a Framework for Optimization and ApproximabilityFull-text access may be available. Sign in or learn about subscription options.pp. 249
by Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur
Session 13—Chair: Kevin Compton
Complements of multivalued functionsFull-text access may be available. Sign in or learn about subscription options.pp. 260
by S. Fenner, F. Green, S. Homer, A.L. Selman, T. Thierauf, H. Vollmer
Session 14—Chair: Luc Longpre
A note on decision versus search for graph automorphismFull-text access may be available. Sign in or learn about subscription options.pp. 272-277
by M. Agrawal, V. Arvind
Session 14—Chair: Luc Longpre
Zero Knowledge and the Chromatic NumberFull-text access may be available. Sign in or learn about subscription options.pp. 278
by Uriel Feige, Joe Kilian
Session 14—Chair: Luc Longpre
DNA models and algorithms for NP-complete problemsFull-text access may be available. Sign in or learn about subscription options.pp. 290
by E. Bach, E. Glaser, A. Condon, C. Tanguay
Session 14—Chair: Luc Longpre
Reversible Simulation of Irreversible ComputationFull-text access may be available. Sign in or learn about subscription options.pp. 301
by Ming Li, Paul Vitanyi
Session 14—Chair: Luc Longpre
Author IndexFreely available from IEEE.pp. 307
Showing 35 out of 35