• DocumentCode
    2221471
  • Title

    Logic, complexity, and games

  • Author

    Fagin, Ronald

  • Author_Institution
    IBM Almaden Research Center
  • fYear
    2000
  • fDate
    26-28 June 2000
  • Firstpage
    3
  • Lastpage
    3
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 2000. Proceedings. 15th Annual IEEE Symposium on
  • Conference_Location
    Santa Barbara, CA, USA
  • ISSN
    1043-6871
  • Print_ISBN
    0-7695-0725-5
  • Type

    conf

  • DOI
    10.1109/LICS.2000.855750
  • Filename
    855750
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2221471