An Approach To P=NP
Dexter Kozen is a famous theorist, who among many other wonderful things coinvented the notion of alternating Turing Machines. He also is the author of a terrific book —his other books are pretty neat too—but this one is my favorite. Dexter also proved a controversial theorem decades ago about the power of diagonal methods in the separation of complexity classes. More on that later.
KeywordsComplexity Class Linear Time Algorithm Circuit Complexity Boolean Circuit Polynomial Hierarchy
Unable to display preview. Download preview PDF.