First Page | Document Content | |
---|---|---|
Date: 2009-08-14 00:50:42Computational complexity theory Complexity classes Theory of computation FO PSPACE SO P EXPTIME Boolean algebra Co-NP-complete Reduction Descriptive complexity theory | Introduction & Motivation Relations and Operations Boolean and 3-element casesAdd to Reading ListSource URL: www.bedewell.comDownload Document from Source WebsiteFile Size: 514,13 KBShare Document on Facebook |