Title :
Logic, complexity, and games
Author_Institution :
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.
Keywords :
Complexity theory; Computational complexity; Game theory; Logic; Polynomials;
Conference_Titel :
Logic in Computer Science, 2000. Proceedings. 15th Annual IEEE Symposium on
Conference_Location :
Santa Barbara, CA, USA
Print_ISBN :
0-7695-0725-5
DOI :
10.1109/LICS.2000.855750
