CIRCUIT INTEGRATION THROUGH LATTICE HYPERTERMS

DOI10.1142/S179383091100105XzbMath1219.90145MaRDI QIDQ3007769

Vardges Melkonian

Publication date: 17 June 2011

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationlatticeshyperterms\(k\)-out-of-\(n\) diagramslogic circuit reduction

Mathematics Subject Classification ID

Related Items (6)

Super-De Morgan functions and free De Morgan quasilattices ⋮ Artin theorem for semigroups ⋮ A set-theoretical representation for weakly idempotent lattices and interlaced weakly idempotent bilattices ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hyperidentities of weakly idempotent lattices.

Cites Work

• Complexity of terms, superpositions, and generalized hypersubstitutions
• Separation of clones of cooperations by cohyperidentities
• Betti numbers and minimal free resolutions for multi-state system reliability bounds
• Hyperidentities and hypervarieties
• Minimum \(\varepsilon\)-equivalent circuit size problem
• The Complexity of Boolean Formula Minimization
• BINARY REPRESENTATIONS OF ALGEBRAS WITH AT MOST TWO BINARY OPERATIONS: A CAYLEY THEOREM FOR DISTRIBUTIVE LATTICES
• MULTI-HYPERSUBSTITUTIONS AND COLORED SOLID VARIETIES

This page was built for publication: CIRCUIT INTEGRATION THROUGH LATTICE HYPERTERMS