On a convex geometric connection to threshold logic
From MaRDI portal
Publication:6616807
DOI10.1007/978-3-031-52969-6_9MaRDI QIDQ6616807FDOQ6616807
Authors: M. Reza Emamy-K., Gustavo A. Meléndez Ríos 
Publication date: 9 October 2024
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Structure and representation theory of distributive lattices (06D05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex Polytopes
- Derangements on the \(n\)-cube
- Title not available (Why is that?)
- Title not available (Why is that?)
- The r-cubical lattice and a generalization of the cd-index
- Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
- On the cuts and cut number of the 4-cube
- On the lattice of faces of the 𝑛-cube
- Combinatorial Structure of the Faces of then-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
- Decomposability of partially defined Boolean functions
- A geometric connection to threshold logic via cubical lattices
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)
