Author:
Boumarafi Yazid,Salhi Yakoub
Publisher
Springer International Publishing
Reference22 articles.
1. Boros, E., Hammer, P.L., Sun, X.: Recognition of q-Horn formulae in linear time. Ann. Math. Artif. Intell. 1, 21–32 (1990)
2. Boumarafi, Y., Sais, L., Salhi, Y.: From SAT to maximum independent set: a new approach to characterize tractable classes. In: LPAR-21 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, 7–12 May 2017, pp. 286–299 (2017)
3. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1999)
4. Chandrasekharan, N., Iyengar, S.S.: NC algorithms for recognizing chordal graphs and k trees. IEEE Trans. Comput. 37(10), 1178–1183 (1988)
5. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151–158 (1971)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Solving Exactly-One-SAT;2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI);2019-11