On a convex geometric connection to threshold logic

DOI10.1007/978-3-031-52969-6_9MaRDI QIDQ6616807zbMATH OpenFDO

Authors M. Reza Emamy-K., Gustavo A. Meléndez Ríos

Publication date 9 October 2024

zbMATH Keywords

convex polytopescubical latticesthreshold logic

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Structure and representation theory of distributive lattices (06D05)

Cites work

• scientific article; zbMATH DE number 446494 (Why is no real title available?)
• scientific article; zbMATH DE number 3504992 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• A geometric connection to threshold logic via cubical lattices
• An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function
• Combinatorial Structure of the Faces of then-Cube
• Convex Polytopes
• Decomposability of partially defined Boolean functions
• Derangements on the \(n\)-cube
• Geometry of cut-complexes and threshold logic
• On the covering cuts of c d (d\(\leq 5)\)
• On the cuts and cut number of the 4-cube
• On the lattice of faces of the 𝑛-cube
• Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
• The r-cubical lattice and a generalization of the cd-index

This page was built for publication: On a convex geometric connection to threshold logic

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