12. CoCo 1997:
Ulm, Germany
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997.
IEEE Computer Society 1997, ISBN 0-8186-7907-7
Session 1
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Session 2
export record as
dblp key:
Lance Fortnow :
Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability.
52-60
export record as
dblp key:
Kenneth W. Regan :
Polynomial Vicinity Circuits and Nonlinear Lower Bounds.
61-68
export record as
dblp key:
Rainer Schuler :
A Note on Universal Distributions for Polynomial-Time Computable Distributions.
69-73
export record as
dblp key:
Session 3
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Session 4
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Session 5
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Ulrich Hertrampf :
Acceptance by Transformation Monoids (with an Application to Local Self Reductions).
213-224
Session 6
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Session 7
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
export record as
dblp key:
Stasys Jukna :
Finite Limits and Monotone Computations: The Lower Bounds Criterion.
302-313