Author:
Elbassioni Khaled,Rauf Imran
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference42 articles.
1. Computational Learning Theory: An Introduction;Anthony,1992
2. Hypergraphs;Berge,1989
3. Complexity of identification and dualization of positive Boolean functions;Bioch;Information and Computation,1995
4. An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension;Boros;Parallel Processing Letters,2000
5. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, Generating maximal independent sets for hypergraphs with bounded edge-intersections, in: LATIN’04: Proceedings of the 6th Latin American Symposium on Theoretical Informatics, 2004, pp. 488–498.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A study on monotone self-dual Boolean functions;Acta Mathematicae Applicatae Sinica, English Series;2017-02
2. Faster Algorithms to Enumerate Hypergraph Transversals;LATIN 2016: Theoretical Informatics;2016