1. On the computational complexity of finding a kernel;Chvátal,1973
2. A uniform method for proving lower bounds on the computational complexity of logical theories;Compton;Ann. Pure Appl. Logic,1990
3. The complexity of theorem-proving procedures;Cook,1971
4. Exact complexity of problems of incompletely specified automata;Creignou;Tech. Report Univ. de Caen, France, Cahiers du LIUC 92-9,1992
5. Ann. Math. Artificial Intelligence;Creignou,1995