scientific article; zbMATH DE number 850402

MaRDI QIDQ4866427zbMATH OpenFDO

Authors A. A. Semenov

Publication date 31 October 1996

zbMATH Keywords

complexity of circuit\(n\)-ary Boolean functions

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• scientific article; zbMATH DE number 4187721
• scientific article; zbMATH DE number 4097290
• On the complexity of realizing the powers of a Boolean \((n,n)\)-function
• Optimal bounds for the approximation of Boolean functions and some applications

Cited in

(13)

• Minimum \(\varepsilon\)-equivalent circuit size problem
• To the problem of realizability of Boolean functions by circuits in a basis of unreliable functional elements
• Asymptotically best method for synthesis of Boolean recursive circuits
• Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity
• The complexity of Boolean function implementation in some classes of automaton circuits
• scientific article; zbMATH DE number 6004901 (Why is no real title available?)
• The complexity of the descriptiveness of Boolean circuits over different sets of gates
• scientific article; zbMATH DE number 609985 (Why is no real title available?)
• scientific article; zbMATH DE number 15477 (Why is no real title available?)
• scientific article; zbMATH DE number 4187721 (Why is no real title available?)
• On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits
• scientific article; zbMATH DE number 3863114 (Why is no real title available?)
• Succinct functional commitment for a large class of arithmetic circuits

This page was built for publication:

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