scientific article; zbMATH DE number 4003531

zbMATH Open0618.68046MaRDI QIDQ4728249FDOQ4728249

Authors: Bernt Lindström 

Publication date: 1987

Title of this publication is not available (Why is that?)

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

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)

Cited In (11)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hard-core theorems for complexity classes
• On the classification of NP-complete problems in terms of their correlation coefficient
• Title not available (Why is that?)
• Component model for a NP-hard problem
• Title not available (Why is that?)
• Improving the classification of complexities
• Oracle and interactive computations, post-Turing thesis and man-machine interactions
• Title not available (Why is that?)

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)