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

Proceedings of Computational Complexity. Twelfth Annual IEEE Conference

June 24 1997 to June 27 1997

Ulm GERMANY

ISSN: 1093-0159

ISBN: 0-8186-7907-7

Table of Contents

Proceedings of Computational Complexity. Twelfth Annual IEEE ConferenceFreely available from IEEE.pp. i-i
ForewordFreely available from IEEE.pp. viii
Committees and AcknowledgementsFreely available from IEEE.pp. ix
Best Student Paper AwardFreely available from IEEE.pp. x
Session Chair: Josk Balcazar
Six Hypotheses in Search of a TheoremFull-text access may be available. Sign in or learn about subscription options.pp. 2
by Harry Buhrman, Lance Fortnow, Leen Torenvliet
Session Chair: Josk Balcazar
Inequalities for Shannon entropies and Kolmogorov ComplexitiesFull-text access may be available. Sign in or learn about subscription options.pp. 13
by D. Hammer, A.E. Romashchenko, A. Shen, N.K. Vereshchagin
Session Chair: Josk Balcazar
Circuits Over PP and PLFull-text access may be available. Sign in or learn about subscription options.pp. 24
by Richard Beigel, Bin Fu
Session Chair: Josk Balcazar
The General Notion of a Dot-OperatorFull-text access may be available. Sign in or learn about subscription options.pp. 36
by Bernd Borchert, Riccardo Silvestri
Session Chair: Josk Balcazar
Reversible Space Equals Deterministic SpaceFull-text access may be available. Sign in or learn about subscription options.pp. 45
by Klaus-Jorn Lange, Pierre McKenzie, Alain Tapp
Session 2
Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for SatisfiabilityFull-text access may be available. Sign in or learn about subscription options.pp. 52
by Lance Fortnow
Session 2
Polynomial Vicinity Circuits and Nonlinear Lower BoundsFull-text access may be available. Sign in or learn about subscription options.pp. 61
by Kenneth W. Regan
Session 2
A note on universal distributions for polynomial-time computable distributionsFull-text access may be available. Sign in or learn about subscription options.pp. 69-73
by R. Schuler
Session 2
LR(k) Testing is Average Case CompleteFull-text access may be available. Sign in or learn about subscription options.pp. 74
by Christoph Karg
Session 3
Complexity and Expressive Power of Logic ProgrammingFull-text access may be available. Sign in or learn about subscription options.pp. 82
by Evgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov
Session 3
Hyper-Polynomial Hierarchies and the NP-JumpFull-text access may be available. Sign in or learn about subscription options.pp. 102
by S. Fenner, S. Homer, R. Pruim, M. Schaefer
Session 3
The Density of Weakly Complete Problems under Adaptive ReductionsFull-text access may be available. Sign in or learn about subscription options.pp. 111
by Jack H. Lutz, Yong Zhao
Session 3
Separating NP-Completeness Notions Under Strong HypothesesFull-text access may be available. Sign in or learn about subscription options.pp. 121
by K. Ambos-Spies, L. Bentzien
Session 3
Undecidability Results For Low Complexity Degree StructuresFull-text access may be available. Sign in or learn about subscription options.pp. 128
by R. Downey, A. Nies
Session 4
On TC/sup 0/, AC/sup 0/, and Arithmetic CircuitsFull-text access may be available. Sign in or learn about subscription options.pp. 134
by M. Agrawal, E. Allender, S. Datta
Session 4
Upper and Lower Bounds for Some Depth-3 Circuit ClassesFull-text access may be available. Sign in or learn about subscription options.pp. 149
by Richard Beigel, Alexis Maciel
Session 4
Circuit Bottom Fan-in and Computational PowerFull-text access may be available. Sign in or learn about subscription options.pp. 158
by Liming Cai, Jianer Chen, Johan Hastad
Session 4
A Lower Bound For Perceptrons And An Oracle Separation Of The PP/sup PH/ HierarchyFull-text access may be available. Sign in or learn about subscription options.pp. 165
by C. Berg, S. Ulfberg
Session 5
On Operators of Higher TypesFull-text access may be available. Sign in or learn about subscription options.pp. 174
by Heribert Vollmer, Klaus W. Wagner
Session 5
Time Bounded Frequency ComputationsFull-text access may be available. Sign in or learn about subscription options.pp. 185
by Maren Hinrichs, Gerd Wechsung
Session 5
Circuits And Expressions With Non-Associative GatesFull-text access may be available. Sign in or learn about subscription options.pp. 193
by J. Berman, A. Drisko, F. Lemieu, C. Moore, D. Therien
Session 5
A Nonadaptive NC Checker for Permutation Group IntersectionFull-text access may be available. Sign in or learn about subscription options.pp. 204
by V. Arvind, J. Toran
Session 5
Acceptance by Transformation Monoids (with an Application to Local Self Reductions)Full-text access may be available. Sign in or learn about subscription options.pp. 213
by Ulrich Hertrampf
Session 6
On Randomization In Online ComputationFull-text access may be available. Sign in or learn about subscription options.pp. 226
by A. Borodin, R. El-Yaniv
Session 6
Randomized Simultaneous Messages: Solution Of A Problem Of Yao In Communication ComplexityFull-text access may be available. Sign in or learn about subscription options.pp. 239
by L. Babai, P.G. Kimmel
Session 6
The Communication Complexity of the Universal RelationFull-text access may be available. Sign in or learn about subscription options.pp. 247
by Gabor Tardos, Uri Zwick
Session 7
A Short Guide To Approximation Preserving ReductionsFull-text access may be available. Sign in or learn about subscription options.pp. 262
by P. Crescenzi
Session 7
Tight Bound on Johnson's Algoritihm for Max-SATFull-text access may be available. Sign in or learn about subscription options.pp. 274
by Jianer Chen, Donald K. Friesen, Hao Zheng
Session 7
Constraint Satisfaction: The Approximability of Minimization ProblemsFull-text access may be available. Sign in or learn about subscription options.pp. 282
by Sanjeev Khanna, Madhu Sudan, Luca Trevisan
Session 7
A note on the bottleneck counting argumentFull-text access may be available. Sign in or learn about subscription options.pp. 297-301
by J. Simon, Shi-Chun Tsai
Session 7
Finite Limits and Monotone Computations: The Lower Bounds CriterionFull-text access may be available. Sign in or learn about subscription options.pp. 302
by Stasys Jukna
Session 7
Author IndexFreely available from IEEE.pp. 315
Showing 36 out of 36