On a convex geometric connection to threshold logic

DOI10.1007/978-3-031-52969-6_9MaRDI QIDQ6616807

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

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A geometric connection to threshold logic via cubical lattices
• 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
• Decomposability of partially defined Boolean functions
• 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
• Convex Polytopes

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