1. The complexity of theorem-proving procedures;Cook,1971
2. On the complexity of timetable and multicommodity flow problems;Even;SIAM J. Comput.,1976
3. Computers and Intractability: A Guide to the Theory of NP-completeness;Garey,1979
4. On representations of subsets;Hall;J. London Math. Soc.,1935
5. Fundamentals of Computer Algorithms;Horowitz,1978