Characterizations of Presburger Functions

DOI10.1137/0210003zbMATH Open0471.68032OpenAlexW2050570101MaRDI QIDQ3926041FDOQ3926041

Oscar H. Ibarra, Brian S. Leininger

Publication date: 1981

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0210003

zbMATH Keywords

straight-line programPresburger formulasimple program

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Theory of software (68N99) Recursive functions and relations, subrecursive hierarchies (03D20)

Cited In (1)

• A note on the complexity of program evaluation

This page was built for publication: Characterizations of Presburger Functions

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