A note on the complexity of program evaluation

DOI10.1007/BF01744435MaRDI QIDQ3319774zbMATH OpenOpenAlexFDO

Authors Oscar H. Ibarra, Brian S. Leininger, Louis E. Rosier

Publication date 1984

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

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

zbMATH Keywords

complexity of program evaluationinput-free program without nested loopssimple loop programs

Mathematics Subject Classification ID

Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Program evaluation as a decision problem
• Applying Mccabe's complexity measure to multiple-exit programs
• Mixed evaluation of relations in programs
• A distributionally robust analysis of the program evaluation and review technique
• scientific article; zbMATH DE number 1964949
• The Mixing Problem in Programme Evaluation
• scientific article; zbMATH DE number 3420721

Cites work

• Characterizations of Presburger Functions
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
• On the Computational Complexity of Algorithms
• On the Computational Complexity of Program Scheme Equivalence
• Simple programming languages and restricted classes of Turing machines
• Simple Programs Realize Exactly Presburger Formulas
• Subrecursive Programming Languages, Part I
• The Complexity of the Equivalence Problem for Simple Programs
• The Equivalence Problem of Simple Programs

Cited in

(8)

• Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
• On the complexity of the correctness problem for non-zeroness test instruction sequences
• The event-history approach to program evaluation
• On simple programs with primitive conditional statements
• scientific article; zbMATH DE number 4066332 (Why is no real title available?)
• The Garland measure and computational complexity of stack programs
• Machines, Computations, and Universality
• On the complexity of commutativity analysis

This page was built for publication: A note on the complexity of program evaluation

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