Geometry of cut-complexes and threshold logic-Reference-Cited by-同舟云学术

Geometry of cut-complexes and threshold logic

Published:1999-07 Issue:1-2 Volume:65 Page:91-100
ISSN:0047-2468
Container-title:Journal of Geometry
language:en
Short-container-title:J Geom

Author:

Emamy-K. M. Reza

Publisher

Springer Science and Business Media LLC

Subject

Geometry and Topology

Link

http://link.springer.com/content/pdf/10.1007/BF01228680.pdf

Reference16 articles.

1. Barnette, D.: A family of neighborly polytopes. Israel J. Math.39 (1981), 127?140.

2. Emamy-K., M. R.: On the cuts and cut-number of the 4 ?cube. J. Combin. Theory Ser. A41, 2 (1986), 221?227.

3. Emamy-K., M. R. andCaiseda, C.: An efficient algorithm for characterization of cut-complexes. Congressus Numerantium85 (1991), 89?95.

4. Emamy-K., M. R.: A new connection between convex geometry and threshold logic. Math. Appl. Ser.,329, Combinatorics Advances, Kluwer Acad. Pub., C. J. Colbourn and E. Mahmoodian (eds.) (1995), 121?128.

5. Caiseda, C: Characterization, enumeration and generation of pseudo-Boolean functions for 5 and 6-cubes. M.S. thesis, University of Puerto Rico, May 1991.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On a Convex Geometric Connection to Threshold Logic;Springer Proceedings in Mathematics & Statistics;2024

2. Cuts, c-Cuts, and c-Complexes over the n-Cube;Lecture Notes in Computer Science;2011

3. A geometric connection to threshold logic via cubical lattices;Annals of Operations Research;2009-08-14

4. The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic;Electronic Notes in Discrete Mathematics;2004-10