View in EDS PDF Full Text ePub Full Text

Logic, Automata, and Computational Complexity: The Works of Stephen A. Cooj

Saved in:
Bibliographic Details
Title: Logic, Automata, and Computational Complexity: The Works of Stephen A. Cooj
Description: Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for “his advancement of our understanding of the complexity of computation in a significant and profound way.” This volume includes a selection of seminal papers embodying the work that led to this award, exemplifying Cook's synthesis of ideas and techniques from logic and the theory of computation including NP-completeness, proof complexity, bounded arithmetic, and parallel and space-bounded computation. These papers are accompanied by contributed articles by leading researchers in these areas, which convey to a general reader the importance of Cook's ideas and their enduring impact on the research community. The book also contains biographical material, Cook's Turing Award lecture, and an interview. Together these provide a portrait of Cook as a recognized leader and innovator in mathematics and computer science, as well as a gentle mentor and colleague.
Authors: Bruce M. Kapron
Resource Type: eBook.
Categories: COMPUTERS / Information Theory
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
  – Type: ebook-epub
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 3868223
RelevancyScore: 1116
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 1116.28857421875
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$3868223$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$3868223$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Logic, Automata, and Computational Complexity: The Works of Stephen A. Cooj
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook won the 1982 Turing Award for “his advancement of our understanding of the complexity of computation in a significant and profound way.” This volume includes a selection of seminal papers embodying the work that led to this award, exemplifying Cook's synthesis of ideas and techniques from logic and the theory of computation including NP-completeness, proof complexity, bounded arithmetic, and parallel and space-bounded computation. These papers are accompanied by contributed articles by leading researchers in these areas, which convey to a general reader the importance of Cook's ideas and their enduring impact on the research community. The book also contains biographical material, Cook's Turing Award lecture, and an interview. Together these provide a portrait of Cook as a recognized leader and innovator in mathematics and computer science, as well as a gentle mentor and colleague.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Bruce+M%2E+Kapron%22">Bruce M. Kapron</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Information+Theory%22">COMPUTERS / Information Theory</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=3868223
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    Titles:
      – TitleFull: Logic, Automata, and Computational Complexity: The Works of Stephen A. Cooj
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Bruce M. Kapron
      – PersonEntity:
          Name:
            NameFull: Bruce M. Kapron
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2023
          Identifiers:
            – Type: isbn-print
              Value: 9798400707773
            – Type: isbn-electronic
              Value: 9798400707780
            – Type: isbn-electronic
              Value: 9798400707803
          Titles:
            – TitleFull: Logic, Automata, and Computational Complexity: The Works of Stephen A. Cooj
              Type: main
ResultId 1