On “provable” analogs of and

DOI10.1007/BF01776574MaRDI QIDQ4191606zbMATH OpenOpenAlexFDO

Authors Theodore P. Baker

Publication date 1979

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01776574

zbMATH Keywords

Computational ComplexityNp-Complete ProblemsProvability RequirementsTuring Machines

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Optimization Among Provably Equivalent Programs
• Theory of Provable Recursive Functions

Cited in

(2)

• Independence results in computer science?
• Index sets and presentations of complexity classes

This page was built for publication: On “provable” analogs of and

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