CIRCUIT INTEGRATION THROUGH LATTICE HYPERTERMS
From MaRDI portal
Publication:3007769
DOI10.1142/S179383091100105XzbMath1219.90145MaRDI QIDQ3007769
Publication date: 17 June 2011
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
combinatorial optimization; lattices; hyperterms; \(k\)-out-of-\(n\) diagrams; logic circuit reduction
90C27: Combinatorial optimization
Related Items
Unnamed Item, Unnamed Item, Hyperidentities of weakly idempotent lattices., Super-De Morgan functions and free De Morgan quasilattices, A set-theoretical representation for weakly idempotent lattices and interlaced weakly idempotent bilattices, Artin theorem for semigroups
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