A geometric connection to threshold logic via cubical lattices

DOI10.1007/s10479-009-0593-5zbMath1236.52009OpenAlexW1983020418MaRDI QIDQ646706

M. Reza Emamy-K.

Publication date: 17 November 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-009-0593-5

zbMATH Keywords

convex polytopescubical latticescut-complexesthreshold logic

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Logical aspects of lattices and related structures (03G10) Boolean functions (06E30)

Cites Work

• On the cuts and cut number of the 4-cube
• On the covering cuts of c d (d\(\leq 5)\)
• Geometry of cut-complexes and threshold logic
• An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function
• Derangements on the \(n\)-cube
• The r-cubical lattice and a generalization of the cd-index
• On the lattice of faces of the 𝑛-cube
• Combinatorial Structure of the Faces of then-Cube
• Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A geometric connection to threshold logic via cubical lattices