Logical Deenability versus Computational Complexity: Another Equivalence

@inproceedings{StewartLogicalDV,
  title={Logical Deenability versus Computational Complexity: Another Equivalence},
  author={Alistair Stewart}
}
We examine two diierent classes of program schemes involving arrays, one class, NPSA(1), allowing arrays in their full generality and the other, NPSB(1), only allowing arrays in a (syntactically) restricted form. Our main result is that the open question of whether the complexity class PSPACE is equal to the complexity class NP is equivalent to whether the class of problems (accepted by the program schemes of) NPSA(1) is equal to the class of problems (accepted by the program schemes of) NPSB(1… CONTINUE READING
0 Citations
10 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 10 references

A restri ted se ondorder logi for nite stru tures ,

  • A. Dawar
  • Information andComputation
  • 1998

Complete problems involving boolean labelled stru tures and proje tion translations

  • I. A. Stewart
  • Journal of Logi and Computation
  • 1998

Existential least xedpoint logi and its relatives

  • Y. Gurevi h
  • Journal of Logi and Computation
  • 1997

Hierar hies in lasses ofprogram s hemes

  • S. R. Chauhan A. A. Arratia-Quesada, I. A. Stewart
  • Journal of Logi and Computation
  • 1997

Logi al hara terizations of bounded query lasses II : polynomial - time ora le ma hines

  • I. A. Stewart
  • Fundamenta Informati ae
  • 1993

Logi al and s hemati hara terization of omplexity lasses

  • I. A. Stewart
  • A taInformati a
  • 1992

Fixpoint logi s , relational ma hines and omputational omplexity

  • M. Y. Vardi S. Abiteboul, V. Vianu
  • Journal of the Asso iation for Computing Ma…
  • 1991

Languages that apture omplexity lasses

  • N. Immerman
  • SIAM Journal ofComputing
  • 1988

Similar Papers

Loading similar papers…