First Page | Document Content | |
---|---|---|
Date: 2009-11-10 10:57:12Computational complexity theory Logic Complexity classes Mathematical logic PSPACE FO Second-order logic P versus NP problem Constraint satisfaction problem NP P Constraint satisfaction | Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of LeicesterAdd to Reading ListSource URL: www.bedewell.comDownload Document from Source WebsiteFile Size: 942,69 KBShare Document on Facebook |