Invited Paper: Logic, Complexity, and Games (at LICS 2000)

Authors: Ronald Fagin

Abstract

In this talk, I will discuss an approach to the P = NP question via the correspondence between logic and complexity. The focus will be on the possible use of Ehrenfeucht-Fraíssé games.

BibTeX

  @InProceedings{Fagin-LogicComplexityandG,
    author = 	 {Ronald Fagin},
    title = 	 {Logic, Complexity, and Games},
    booktitle =  {Proceedings of the Fifteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2000)},
    year =	 {2000},
    month =	 {June}, 
    pages =      {3},
    location =   {Santa Barbara, CA, USA}, 
    note =       {Invited Talk},
    publisher =	 {IEEE Computer Society Press}
  }