Author:
Creignou Nadia,Daude Hervé
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. A linear-time algorithm for testing the truth of certain quantified boolean formulas;Aspvall;Inform. Processing Lett.,1979
2. B. Bollobás, Random Graphs, Academic Press, New York 1985.
3. V. Chvátal, B. Reed, Mick gets some (the odds are on his side), in: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, pp. 620–627.
4. L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, 1974.
5. S.A. Cook, The complexity of theorem-proving procedures, in: Third Annual ACM Symposium on Theory of Computing, 1971, pp. 151–158.
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献