The following pages link to M. Reza Emamy-K. (Q1299937):
Displaying 24 items.
- (Q582573) (redirect page) (← links)
- On the cut-complexes of the 5-cube (Q582575) (← links)
- A geometric connection to threshold logic via cubical lattices (Q646706) (← links)
- The number of intervals in the \(m\)-Tamari lattices (Q665767) (← links)
- On the coverings of the \(d\)-cube for \(d\leq 6\) (Q1003460) (← links)
- (Q1097519) (redirect page) (← links)
- On the covering cuts of c d (d\(\leq 5)\) (Q1097520) (← links)
- The worst case behavior of a greedy algorithm for a class of pseudo- Boolean functions (Q1121245) (← links)
- Geometry of cut-complexes and threshold logic (Q1299938) (← links)
- On linear programming and matrix scaling over the algebraic numbers (Q1361844) (← links)
- A special case of set covering problems (Q1908929) (← links)
- On the cut number problem for the 4, and 5-cubes (Q1983113) (← links)
- (Q3139527) (← links)
- (Q3429498) (← links)
- The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic (Q3439143) (← links)
- (Q3487423) (← links)
- (Q3975292) (← links)
- (Q4028521) (← links)
- (Q4400642) (← links)
- (Q4677921) (← links)
- (Q4858964) (← links)
- Notes on a short-cut to the proof of the $\mathbf{M}_3$-$\mathbf{N}_5$ Theorem (Q6523049) (← links)
- On a convex geometric connection to threshold logic (Q6616807) (← links)
- The 5-cube cut number problem: a short proof for a basic lemma (Q6648229) (← links)