An infinite hierarchy in a class of polynomial-time program schemes

DOI10.1007/S00224-005-1230-6MaRDI QIDQ2509042zbMATH OpenOpenAlexFDO

Authors Richard L. Gault, Iain Stewart

Publication date 16 October 2006

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL http://dro.dur.ac.uk/5740/1/5740.pdf

zbMATH Keywords

RFDPS

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Hierarchies in classes of program schemes
• Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures
• Program schemes, arrays, Lindström quantifiers and zero-one laws
• Publication:4945239
• Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws

Cited in

(4)

• Proper hierarchies in polylogarithmic time and absence of complete problems
• Using Program Schemes to Capture Polynomial-Time Logically on Certain Classes of Structures
• Hierarchies in classes of program schemes
• scientific article; zbMATH DE number 5499325 (Why is no real title available?)

This page was built for publication: An infinite hierarchy in a class of polynomial-time program schemes

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