scientific article

zbMATH Open1115.03002MaRDI QIDQ3423449

M. V. Pospelov, Włodzimierz P. Odyniec

Publication date: 22 February 2007

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

zbMATH Keywords

algorithmgraphundecidabilitytextbookNP-completenessdecidabilitypartial recursive functionTuring machinecomputabilityrecursive functionnumberingrandom access machineMarkov normal algorithmPost system

Mathematics Subject Classification ID

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

Related Items (3)

Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Basic Concepts in Algorithms

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 Q3423449)