Lance Fortnow Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:52-60 [Conf]

Kenneth W. Regan Polynomial Vicinity Circuits and Nonlinear Lower Bounds. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:61-68 [Conf]

Rainer Schuler A Note on Universal Distributions for Polynomial-Time Computable Distributions. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:69-73 [Conf]

Christoph Karg LR(k) Testing is Average Case Complete. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:74-80 [Conf]

Jack H. Lutz, Yong Zhao The Density of Weakly Complete Problems under Adaptive Reductions. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:111-120 [Conf]

Christer Berg, Staffan Ulfberg A Lower Bound for Perceptrons and an Oracle Separation of the PP^{PH} Hierarchy. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:165-172 [Conf]

Ulrich Hertrampf Acceptance by Transformation Monoids (with an Application to Local Self Reductions). [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:213-224 [Conf]

László Babai, Peter G. Kimmel Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:239-246 [Conf]

Gábor Tardos, Uri Zwick The Communication Complexity of the Universal Relation. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:247-259 [Conf]

Pierluigi Crescenzi A Short Guide to Approximation Preserving Reductions. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:262-273 [Conf]