![Computational complexity theory / Complexity classes / Theory of computation / FO / PSPACE / IP / NP / P / Reduction / Homomorphism / SO Computational complexity theory / Complexity classes / Theory of computation / FO / PSPACE / IP / NP / P / Reduction / Homomorphism / SO](https://www.pdfsearch.io/img/35c4cf553df9facb981c77df9639caad.jpg) Date: 2010-06-03 07:34:14Computational complexity theory Complexity classes Theory of computation FO PSPACE IP NP P Reduction Homomorphism SO | | The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University,Add to Reading ListSource URL: www.bedewell.comDownload Document from Source Website File Size: 230,66 KBShare Document on Facebook
|