Bruce M. Kapron – författare
Visar alla böcker från författaren Bruce M. Kapron. Handla med fri frakt och snabb leverans.
4 produkter
Logic, Automata, and Computational Complexity
The Works of Stephen a. Cook
Häftad, 2023
579 kr
Lägg i varukorg
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 …
Logic, Automata, and Computational Complexity
The Works of Stephen A. Cook
E-bok, 2023
2076 kr
Lägg i varukorg
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 …
Logic, Automata, and Computational Complexity
The Works of Stephen a. Cook
Inbunden, 2023
816 kr
Lägg i varukorg
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 …
Logic, Automata, and Computational Complexity
The Works of Stephen A. Cook
E-bok, 2023
692 kr
Lägg i varukorg
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 …
