User contributions for Slacka
Jump to navigation
Jump to search
4 January 2014
- 09:3009:30, 4 January 2014 diff hist +32 Traveling Salesman Problem is NP-Complete added Category
- 09:0809:08, 4 January 2014 diff hist +586 Talk:Traveling Salesman Problem is NP-Complete NP is a class of decision problems
31 December 2013
- 14:0314:03, 31 December 2013 diff hist +104 m Traveling Salesman Problem is NP-Complete Added Reference only decision problems can be NP-complete
- 14:0014:00, 31 December 2013 diff hist +198 Traveling Salesman Problem is NP-Complete See https://www.ibm.com/developerworks/community/blogs/jfp/entry/no_the_tsp_isn_t_np_complete
10 November 2012
- 13:5613:56, 10 November 2012 diff hist +30 m Traveling Salesman Problem is NP-Complete refereences
- 13:5313:53, 10 November 2012 diff hist +123 Traveling Salesman Problem is NP-Complete →Problem Statement
- 13:5013:50, 10 November 2012 diff hist +370 Talk:Traveling Salesman Problem is NP-Complete decision problem is NP-Complete but optimization problem is NOT in NP-Complete