The computational complexity of program schemata

DOI10.1016/S0022-0000(76)80020-7MaRDI QIDQ1223162zbMATH OpenFDO

Authors Klaus Weihrauch

Publication date 1976

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3557239 (Why is no real title available?)
• scientific article; zbMATH DE number 3576680 (Why is no real title available?)
• scientific article; zbMATH DE number 3453105 (Why is no real title available?)
• scientific article; zbMATH DE number 3407149 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Equivalence of programs with structured variables
• On formalised computer programs

Cited in

(1)

• scientific article; zbMATH DE number 3737028 (Why is no real title available?)

This page was built for publication: The computational complexity of program schemata

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