eBook, ePUB

Logic, Automata, and Computational Complexity (eBook, ePUB)

The Works of Stephen A. Cook

Redaktion: Kapron, Bruce M.
Versandkostenfrei!
Sofort per Download lieferbar
90,95 €
inkl. MwSt.
Alle Infos zum eBook verschenken
PAYBACK Punkte
45 °P sammeln!
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...

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, D ausgeliefert werden.