Polynomial computations in non-deterministic loop-programs and PL-programs

DOI10.1080/00207168308803387MaRDI QIDQ3668873zbMATHOpenAlexFDO

Authors Amihood Amir, Yaacov Choueka

Publication date 1983

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168308803387

zbMATH Keywords

nondeterminismnon- deterministic programsloop-programspolynomially computable functions

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Loop-programs and polynomially computable functions

Cited in

(1)

• A syntactical definition of the problem

This page was built for publication: Polynomial computations in non-deterministic loop-programs and PL-programs

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