scientific article; zbMATH DE number 6007838

MaRDI QIDQ3115198zbMATH OpenFDO

Authors K. L. Rychkov

Publication date 20 February 2012

zbMATH Keywords

Boolean functioncomplexity of circuitsswitching circuit

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 3390658
• On complexity of oriented contact circuits with limited out-degree
• Entropy of contact circuits and lower bounds on their complexity
• scientific article; zbMATH DE number 4168397
• On the complexity of realizing some systems of the functions of the algebra of logic by contact and generalized contact circuits
• scientific article; zbMATH DE number 4189653
• Complexity and structure of near-minimal contact circuits for elementary symmetric functions
• On the complexity of the realization of multiports by planar contact circuits
• scientific article; zbMATH DE number 850315
• On the complexity of circuit satisfiability

Cited in

(7)

• Minimal contact circuits for characteristic functions of spheres
• On implementation of Boolean functions by contact circuits with a constant uniform width
• On the complexity of realizing some systems of the functions of the algebra of logic by contact and generalized contact circuits
• scientific article; zbMATH DE number 23021 (Why is no real title available?)
• Limitations of incremental dynamic programming
• scientific article; zbMATH DE number 3390658 (Why is no real title available?)
• On the synthesis of oriented contact circuits with certain restrictions on adjacent contacts

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 Q3115198)