Author:
Creignou N.,Hebrard J.-J.
Subject
Computer Science Applications,General Mathematics,Software
Reference12 articles.
1. 1. ASPVALL B., PLASS M. F. and TARJAN R. E., A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, 1979, 8, (3), pp. 121-123.5264510398.68042
2. 2. COOK S. A., The complexity of theorem-proving procedures. In Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151-158.0253.68020
3. 3. CREIGNOU N. and HERMANN M., Complexity of Generalized Satisfiability Counting Problems, Information and Computation, 1996, 125, (1), pp. 1-12.13858040853.68110
4. 4. DOWLING W. F. and GALLIER J. H., Linear-time algorithms for testing the satisfiability of propositional Horn formulæ, Journal of Logic Programming, 1984, 3, pp. 267-284.7701560593.68062
5. 5. GAREY M. R. and JOHNSON D. S., Computers and intractability: A guide to the theory of NP-completeness, W. H. Freeman and Co, 1979.5190660411.68039
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献