There's still time! Find the perfect Father's Day gift with store pickup | Shop NowThere's still time! Find the perfect Father's Day gift with store pickup | Shop Now
Add Item to wish listAdd Item to wish list

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

By Bruce M. Kapron (Editor)
eBook
$119.88
By Bruce M. Kapron (Editor)
Membership Card Icon
Collect stamps to save with Rewards. 10 stamps = $5. Learn More
Formats
Select a store to view item availability.

Available on compatible , the free NOOK App, and in My Digital Library

NOOK App

Download NOOK app

NOOK Devices

NOOK eReaders

  • NOOK GlowLight 4 Plus
  • NOOK GlowLight 4e
  • NOOK GlowLight 4
  • NOOK GlowLight Plus 7.8"
  • NOOK GlowLight 3
  • NOOK GlowLight Plus 6"

NOOK Tablets

  • NOOK 9" Lenovo Tablet
  • NOOK 10" HD Lenovo Tablet
  • NOOK Tablet 7" & 10.1"
  • NOOK by Samsung Galaxy Tab 7.0 [Tab A and Tab 4]
  • NOOK by Samsung [Tab 4 10.1, S2 & E]

Free NOOK Reading Apps

  • NOOK for iOS
  • NOOK for Android

BN.com website

Go to your Digital Library in My Account

Limit 1 per customer

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 co...

Categories

ComputersComputers - General & MiscellaneousGeneral & Miscellaneous Computing