- Mitsunori Ogiwara, Lane A. Hemachandra
:
A Complexity Theory for Feasible Closure Properties. SCT 1991: 16-29 - Mitsunori Ogiwara, Antoni Lozano:
On One Query Self-Reducible Sets. SCT 1991: 139-151 - Rafail Ostrovsky:
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs. SCT 1991: 133-138 - Miklos Santha:
On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. SCT 1991: 180-187 - Shouwen Tang, Bin Fu, Tian Liu:
Exponential Time and Subexponential Time Sets. SCT 1991: 230-237 - Jun Tarui:
Degree Compexity of Boolean Functions and Its Applications to Realivized Separations. SCT 1991: 382-390 - Seinosuke Toda, Mitsunori Ogiwara:
Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy. SCT 1991: 2-12 - V. Vinay:
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. SCT 1991: 270-284 - Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991. IEEE Computer Society 1991, ISBN 0-8186-2255-5 [contents]
