Tunable binary procedures and programs with loops

MaRDI QIDQ1058504zbMATH OpenFDO

Authors V. L. Artyukhov, B. P. Kuznetsov, A. A. Shalyto

Publication date 1984

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

complexity boundsevaluation of a system of Boolean formulasprogram realization of systems of Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Review text

A method is proposed for the evaluation of a system of Boolean formulas using a program with a loop in which some parameters generated by a previously created array are successively passed to a special procedure. The program with a loop is termed a cyclic binary program, and the procedure is termed a tunable binary procedure. Basic design principles and complexity bounds are considered.

Recommendations

• Ways of synthesizing binary programs admitting recursive call of procedures
• scientific article; zbMATH DE number 3939260
• Realization of Boolean formulae by linear binary graphs. II: Estimates of the number and the total length of routes
• P-functions: A new tool for the analysis and synthesis of binary programs
• Time of computations on linear binary graphs

Cited in

(1)

• Ways of synthesizing binary programs admitting recursive call of procedures

This page was built for publication: Tunable binary procedures and programs with loops

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