Reputation
428
Top tag
Next privilege 500 Rep.
Access review queues
Badges
4 14
Impact
~9k people reached

  • 0 posts edited
  • 0 helpful flags
  • 70 votes cast
Jul
11
comment Partition Problem, verifying solution in polynomial time
Thanks. That was what I was looking for.
Jul
11
accepted Partition Problem, verifying solution in polynomial time
Jul
11
comment Partition Problem, verifying solution in polynomial time
@deinst : thanks first, and I was wondering, for the travelling salesman problem (NP-complete too) how do you tell if the equation is satisfiable ? since it's a min ?
Jul
11
comment Partition Problem, verifying solution in polynomial time
thanks, but That's not really my question. I know that for a perfect partition it's easy to test (it's either 1 or 0, just make the calculation) But when I have a solution that is not perfect, how do I know in polynomial time my solution is not THE solution ? I've edited the post
Jul
11
revised Partition Problem, verifying solution in polynomial time
added 250 characters in body
Jul
11
asked Partition Problem, verifying solution in polynomial time
Jul
8
awarded  Supporter
Jun
27
awarded  Editor
Jun
27
awarded  Teacher
Jun
27
revised Problems with percentages
added 178 characters in body
Jun
27
answered Problems with percentages