First Page | Document Content | |
---|---|---|
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 WebsiteFile Size: 230,66 KBShare Document on Facebook |