Logic in Computer Science, Symposium on (2000)

Santa Barbara, California

June 26, 2000 to June 29, 2000

ISSN: 1043-6871

ISBN: 0-7695-0725-5

pp: 3

R. Fagin , IBM Almaden Research Center

ABSTRACT

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.

INDEX TERMS

Logic, Computational complexity, Complexity theory, Game theory, Polynomials

CITATION

R. Fagin, "Logic, complexity, and games,"

*Logic in Computer Science, Symposium on(LICS)*, Santa Barbara, California, , pp. 3.

doi:10.1109/LICS.2000.855750

CITATIONS

SEARCH