Logic in Computer Science, Symposium on (2000)
Santa Barbara, California
June 26, 2000 to June 29, 2000
R. Fagin , IBM Almaden Research Center
Summary form only given. The author summarizes his proposed talk on an approach to the P = NP question via the correspondence between logic and complexity. The main focus will be on the possible use of Ehrenfeucht-Fra-sse games.
Logic, Computational complexity, Complexity theory, Game theory, Polynomials
R. Fagin, "Logic, complexity, and games," Logic in Computer Science, Symposium on(LICS), Santa Barbara, California, , pp. 3.