scientific article; zbMATH DE number 2167361

MaRDI QIDQ4677649zbMATH OpenFDO

Authors Jean-François Rey

Publication date 12 May 2005

zbMATH Keywords

algorithmapproximation algorithmcomputation theoryP-NPrecursion theoryTuring machine

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 3909745
• scientific article; zbMATH DE number 610968
• Computability and complexity theory.
• scientific article; zbMATH DE number 43004
• scientific article; zbMATH DE number 578252

Cited in

(5)

• P, NP, and NP-completeness. The basics of computational complexity.
• Approximative Algorithmen und Nichtapproximierbarkeit
• scientific article; zbMATH DE number 54107 (Why is no real title available?)
• Algorithmic complexity
• scientific article; zbMATH DE number 2226428 (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 Q4677649)