Back to Results
First PageMeta Content
Computational 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 List

Document Date: 2010-06-03 07:34:14


Open Document

File Size: 230,66 KB

Share Result on Facebook