Kirkpatric, D. G. (1974). "Topics in the Complexity of Combinatorial Algorithms" Ph.D. Thesis, University of Toronto.  Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
The Complexity of Automated Reasoning - André Vellino (1989) (6 citations) (Correct)
No context found.
Kirkpatric, D. G. (1974). "Topics in the Complexity of Combinatorial Algorithms" Ph.D. Thesis, University of Toronto.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC