problem about np-complete-Collection of common programming errors

• 
  danben
  runtime np-complete np-hard asymptotic-complexity
  Is there some language that is NP-complete but for which we know some “quick” algorithm? I don’t mean like the ones for knapsack where we can do well on average, I mean that even in the worst case the runtime is something like 2^n^epsilon, where the result holds for any epsilon>0 and so we can allow it to get arbitrarily close to 0.
• 
  Antti Huima
  algorithm np-complete
  Today there was a question on SO, where the author was given an NP-complete problem during an interview and he obviously hadn’t been told that it was one.What is the purpose of asking such questions? What behavior does the interviewer expect when asking such things? Proof? Useful heuristics? And is it even legitimate to ask one if it’s not a well-known NP-complete problem everyone should know about? (there’s a plenty of them)

Web site is in building