Introduction to algorithm theory

MaRDI QIDQ3423449zbMATH OpenFDO

Authors M. V. Pospelov, W. Odyniec

Publication date 22 February 2007

zbMATH Keywords

algorithmcomputabilitydecidabilitygraphMarkov normal algorithmNP-completenessnumberingpartial recursive functionPost systemrandom access machinerecursive functiontextbookTuring machineundecidability

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Computability and recursion theory (03Dxx) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 225477
• scientific article; zbMATH DE number 530148
• scientific article; zbMATH DE number 1955470
• Introducing the theory of computation
• scientific article; zbMATH DE number 107969

Cited in

(4)

• scientific article; zbMATH DE number 3934393 (Why is no real title available?)
• scientific article; zbMATH DE number 54110 (Why is no real title available?)
• scientific article; zbMATH DE number 2237397 (Why is no real title available?)
• Basic Concepts in Algorithms

This page was built for publication: Introduction to algorithm theory

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