MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "The Complexity of Theorem-Proving Procedures" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 10 documents found, showing 1 through 10.
ATOM RSS
  • Languages for Polynomial-Time Queries - an Ongoing Quest  
  • by Phokion G. Kolaitis, Laws Information — 1992 — In Proc. 19th International Colloq. on Automata, Languages, and Programming
  • …, IBM, Yorktown Heights, N.Y., 1975. [13] S. A. Cook. The complexity of theorem proving procedures…
  • Add To MetaCart
  • Effective Interpolation  
  • by Jan Krajicek — 1997
  • … and J. Kraj'icek, pp.119, Oxford Press. [33] Cook, S A. (1971) The complexity of theorem proving…
  • Add To MetaCart
  • Design and Analysis of Physical Design Algorithms  
  • by Majid Sarrafzadeh , Elaheh Bozorgzadeh, Ryan Kastner, Ankur Srivastava — 2001 — IN PROC. INTERNATIONAL SYMPOSIUM ON PHYSICAL DESIGN
  • …, 1971, entitled “The Complexity of Theorem Proving Procedures” [20]. He proved that one particular…
  • Cited by 2 (2 self) – Add To MetaCart
  • Resolution Proof Systems with Weak  
  • by Transformat Ion Rules
  • …- ber of its verifiers, contributes to the complexity of theorem proving since, looking at the form…
  • Add To MetaCart
  • Bibliography  
  • by Achh Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger, Pei-hsin Ho, Ao Ravindra K. Ahuja, A. Beringer, G. Aschemann, H. H. Hoos, M. Metzger, A. Wei Gsat, Bm Justin A. Boyan
  • …. The MacMillan Company, New York, 1940. [Coo71] Stephen A. Cook. The complexity of theorem proving…
  • Add To MetaCart
Help! Showing 1 through 10.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB