Tunable binary procedures and programs with loops
From MaRDI portal
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
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)