Logic, Automata, and Computational Complexity: The Works of Stephen a. Cook by B
66,87 €
Logic, Automata, and Computational Complexity. 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.
Jetzt bei Ebay:
