Logic Automata Computational Complexity (17 results)

Condition: new.

Condition: New.

PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Condition: New.

Condition: As New. Unread book in perfect condition.

Paperback. Condition: New. 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.…

HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Condition: New. In English.

paperback. Condition: Very Good.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New. KlappentextProfessor 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 ad.

Taschenbuch. Condition: Neu. Logic, Automata, and Computational Complexity | The Works of Stephen A. Cook | Bruce M Kapron | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2023 | Association for Computing Machinery | EAN 9798400707773 | Verantwortliche Person für die EU: Mare Nostrum Group B.V., Doelen 72, 4831 GR BREDA, NIEDERLANDE, gpsr[at]mare-nostrum[dot]co[dot]uk | Anbieter: preigu.…

Paperback. Condition: New. 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.…

Taschenbuch. Condition: Neu. Neuware - 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.…

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 426 pp. Englisch.…

Taschenbuch. Condition: Neu. Computability | Computability theory, Computer science, Mathematical logic, Turing machine, Automata theory, Hypercomputation, Computational complexity theory, Parallel computing, Halting problem | Frederic P. Miller (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130205133 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.…