Author:
Delgrande James P.,Gupta Arvind
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference21 articles.
1. A.R. Anderson and N.D. Belnap, Jr.,Entailment: The Logic of Relevance and Necessity, Vol. 1 (Princeton University Press, 1975).
2. S. Arora, C. Lund, R. Motwani and M. Sudan, Proof verification and intractability of approximation problems. Manuscript (1992).
3. J. Bondy and U.S.R. Murty,Graph Theory with Applications (North-Holland, 1976).
4. S. Cook, The complexity of theorem-proving procedures, in:Proceedings of the 3rd ACM Symposium on Theory of Computing (1971) pp. 151–158.
5. E. Even, A. Itai and A. Shamir, On the complexity of timetable and multicommodity flow problems,SIAM Journal on Computing 5(4) (1976) 691–701.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献