A geometric connection to threshold logic via cubical lattices
From MaRDI portal
Publication:646706
DOI10.1007/S10479-009-0593-5zbMATH Open1236.52009OpenAlexW1983020418MaRDI QIDQ646706FDOQ646706
Authors: 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
Recommendations
Computational aspects related to convexity (52B55) Boolean functions (06E30) Logical aspects of lattices and related structures (03G10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Derangements on the \(n\)-cube
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: A geometric connection to threshold logic via cubical lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646706)
