Logic, automata, and computational complexity. The works of Stephen A. Cook

DOI10.1145/3588287MaRDI QIDQ6621140zbMATH OpenFDO

Authors

Publication date 17 October 2024

Published in ACM Books (Search for Journal in Brave)

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) History of computer science (68-03) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) History of mathematical logic and foundations (03-03) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Theory of computing (68Qxx) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• scientific article; zbMATH DE number 47207
• An overview of computational complexity
• scientific article; zbMATH DE number 877979
• Relativizations of the P =? NP and Other Problems: Developments in Structural Complexity Theory
• scientific article; zbMATH DE number 3952713

This page was built for publication: Logic, automata, and computational complexity. The works of Stephen A. Cook

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621140)