1. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,2003
2. A sublinear space, polynomial time algorithm for directed s-t connectivity;Barnes;SIAM J. Comput.,1998
3. The complexity of theorem-proving procedures;Cook,1971
4. Deterministic CFL's are accepted simultaneously in polynomial time and log squared space;Cook,1979
5. Monotone monadic SNP and constraint satisfaction;Feder,1993