##
###
Page 511 of Mathematical Reviews Vol. , Issue 99a
[page]

1991
*
Mathematical Reviews
*

These *systems* include the classical formulation of *NP*, interactive proof *systems*, computationally sound proof *systems*, *and* prob- abilistically checkable proofs, which are closely related to multi- prover ...
It turns out that many questions in computational complexity, in particular, the complexity the- ory for small-depth families of Boolean circuits, are *equivalent* to expressibility questions in finite *model* ...