Author:
Altun Mustafa,Riedel Marc D.
Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. Altun, M., Riedel, M.D. Lattice-based computation of Boolean functions. In: Design Automation Conference, 2010, 609–612
2. Altun, M., Riedel, M.D. Logic synthesis for switching lattices. IEEE Transactions on Computers, 61(11): 1588–1600 (2012)
3. Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L. Generating maximal independent sets for hypergraphs with bounded edge-intersections. LATIN 2004: Theoretical Informatics, 488–498, 2004
4. Boros, E., Hammer, P., Ibaraki, T., Kawakami, K. Polynomial-time recognition of 2-monotonic positive boolean functions given by an oracle. SIAM Journal on Computing, 26(1): 93–109 (1997)
5. Eiter, T., Gottlob, G. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 24(6): 1278–1304 (1995)