scientific article; zbMATH DE number 4003531

MaRDI QIDQ4728249zbMATH OpenFDO

Authors Bernt Lindström

Publication date 1987

zbMATH Keywords

NP-complete problemsTuring machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)

Recommendations

• scientific article; zbMATH DE number 218387
• P, NP, and NP-completeness. The basics of computational complexity.
• scientific article; zbMATH DE number 4011937
• scientific article; zbMATH DE number 3978381
• scientific article; zbMATH DE number 2096708

Cited in

(11)

• scientific article; zbMATH DE number 3978381 (Why is no real title available?)
• scientific article; zbMATH DE number 4011937 (Why is no real title available?)
• scientific article; zbMATH DE number 2096708 (Why is no real title available?)
• Hard-core theorems for complexity classes
• On the classification of NP-complete problems in terms of their correlation coefficient
• scientific article; zbMATH DE number 527373 (Why is no real title available?)
• Component model for a NP-hard problem
• scientific article; zbMATH DE number 4076613 (Why is no real title available?)
• Improving the classification of complexities
• Oracle and interactive computations, post-Turing thesis and man-machine interactions
• scientific article; zbMATH DE number 4041256 (Why is no real title available?)

This page was built for publication:

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