Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference9 articles.
1. Recognizing disguised NR(1) instance of the satisfiability problem;Aspvall;J. Algorithms,1980
2. Finding a maximum clique in an arbitrary graph;Balas;SIAM J. Comput.,1986
3. An exact algorithm for the maximum clique problem;Carraghan,1990
4. On renamable Horn and generalized Horn functions;Chandru;Ann. Math. of and AI,1990
5. Linear-time algorithms for testing the satisfiability of propositional Horn formulae;Dowling;J. Logic Programming,1984
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search;Annals of Mathematics and Artificial Intelligence;2014-03-15
2. Integrated Methods for Optimization;International Series in Operations Research & Management Science;2012
3. Bibliography;Optimization Methods for Logical Inference;2011-09-30
4. References;Logic-Based Methods for Optimization;2011-09-30
5. Hidden Threshold Phenomena for Fixed-Density SAT-formulae;Theory and Applications of Satisfiability Testing;2004