13th Annual IEEE Conference on Computational Complexity (CoCo'98) Buffalo, New York June 15-June 18 ISBN: 0-8186-8395-3 Table of Contents
On Membership Comparable Sets (Abstract)
pp. 2
Nonrelativizing Separations (Abstract)
pp. 8
pp. 24
Proofs of Membership vs. Proofs of Knowledge (Abstract)
pp. 34 pp. 46
pp. 58
On Arithmetic Branching Programs (Abstract)
pp. 68 pp. 81
Isolation, Matching, and Counting (Abstract)
pp. 92
A Note on the Hardness of Tree Isomorphism (Abstract)
pp. 101 pp. 106
Models of Computation in Coding Theory (Abstract)
pp. 120
How to Encode a Logical Structure by an OBDD (Abstract)
pp. 122 pp. 132 pp. 141
pp. 154
Hard Sets are Hard to Find (Abstract)
pp. 170
On the Resource Bounded Measure of P/poly (Abstract)
pp. 182
Probabilistic Martingales and BPTIME Classes (Abstract)
pp. 186
pp. 202 pp. 210
Uniformly Hard Languages (Abstract)
pp. 228
Resource-Bounded Measure (Abstract)
pp. 236
Resource Bounded Measure and Learnability (Abstract)
pp. 261
pp. 272 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||
