On a formula synthesizing method

zbMATH Open0874.94044MaRDI QIDQ1358438FDOQ1358438

Authors: Alexander E. Andreev 

Publication date: 1 July 1997

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

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

zbMATH Keywords

Boolean functionsasymptotically optimal methodformula synthesis

Mathematics Subject Classification ID

Cited In (5)

• An Extension of the Method of Cohn and Lindaman
• An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form
• Synthesis of formulas whose depth and complexity do not exceed asymptotically the best estimates of high accuracy
• Lupanov's methods and their importance for the formation of circuit synthesis theory
• The asymptotically best method for synthesizing limited-depth Boolean recursive schemes

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)