MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "A Reply to Hofman On "Why LP cannot solve large instances of NP-complete problems in polynomial time"" – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 716,477 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • NP-Complete  
  • by Fall Volume, Michael Hind, Martin Ruckert
  • … in solving a number of NP-complete coNP-complete problems [3]. The main feature of the above molecular…
  • Add To MetaCart
  • NP-Completeness  
  • by Fabio A. González, Programación Matemática, Gran Escala
  • … is called NP-Complete, and the most interesting thing is that if we are able to find a polynomial time
  • Add To MetaCart
  • .4 Coping With Np-Completeness  
  • by Problems Do Not
  • …, returns some solution with value A(x). Since the problem is NP-complete and A is polynomial, we cannot
  • Add To MetaCart
  • Contextual Reasoning is NP-complete  
  • by Fabio Massacci — 1996 — In National Conference on Artificial Intelligence (AAAI 96
  • … for propositional logic of context is NP-complete and give a tableau based decision procedure which solve
  • Cited by 13 (3 self)Add To MetaCart
  • Parsing for Semidirectional Lambek Grammar is NP-Complete  
  • by Jochen Dörre, Categorial Grammar, Categorial Grammar (cg, In Particular Lambek — 1996
  • ….e. that it is at the same time an SOL- grammar. 3 NP-Completeness of the Parsing Problem We show that the Parsing Problem
  • Add To MetaCart
  • Crozzle: an NP-Complete Problem  
  • by Bradley M. Kuhn, David W. Binkley — 1997 — In SAC ’97: Proceedings of the 1997 ACM symposium on Applied computing
  • problems (unless a polynomial time algorithm for either is produced). It proves that both problems are NP-Complete
  • Cited by 1 (0 self)Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB