Recommendations
- Synthesis of formulas whose depth and complexity do not exceed asymptotically the best estimates of high accuracy
- Asymptotically best method for synthesis of Boolean recursive circuits
- The asymptotically best method for synthesizing limited-depth Boolean recursive schemes
- On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits
- scientific article; zbMATH DE number 3887605
Cited in
(5)- The asymptotically best method for synthesizing limited-depth Boolean recursive schemes
- Synthesis of formulas whose depth and complexity do not exceed asymptotically the best estimates of high accuracy
- An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form
- Lupanov's methods and their importance for the formation of circuit synthesis theory
- An Extension of the Method of Cohn and Lindaman
This page was built for publication: On a formula synthesizing method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1358438)
