User contributions
Jump to navigation
Jump to search
- 13:40, 21 September 2020 diff hist +24 N 10.25 Created page with " Back to Chapter 10"
- 13:40, 21 September 2020 diff hist +24 N 10.23 Created page with " Back to Chapter 10" current
- 13:40, 21 September 2020 diff hist +24 N 10.21 Created page with " Back to Chapter 10" current
- 13:39, 21 September 2020 diff hist +24 N 10.19 Created page with " Back to Chapter 10" current
- 13:39, 21 September 2020 diff hist +24 N 10.17 Created page with " Back to Chapter 10" current
- 01:31, 21 September 2020 diff hist +24 N 10.15 Created page with " Back to Chapter 10" current
- 01:29, 21 September 2020 diff hist -9 Chapter 10 →Number Problems
- 01:19, 21 September 2020 diff hist +2 Chapter 10 →Number Problems
- 01:17, 21 September 2020 diff hist +534 N 10.11 Created page with "Answer to both a) and b) is no. Knapsack problem is NP-complete. ---- (a) Yes, this is a special case of the Knapsack problem where the value of each item is the same (desc..." current
- 01:17, 21 September 2020 diff hist +2,566 N 10.13 Created page with "==== 1 ==== # 20 x 1 # 1 x 6 + 14 x 1 # 2 x 6 + 8 x 1 # 3 x 6 + 2 x 1 # 1 x 10 + 10 x 1 # 1 x 10 + 1 x 6 + 4 x 1 # 2 x 10 ==== 2 ==== More generally: # there is always o..." current
- 01:16, 21 September 2020 diff hist +24 N 10.9 Created page with " Back to Chapter 10" current
- 01:16, 21 September 2020 diff hist +24 N 10.7 Created page with " Back to Chapter 10" current
- 01:15, 21 September 2020 diff hist +24 N 10.1 Created page with " Back to Chapter 10" current
- 01:15, 21 September 2020 diff hist +24 N 10.5 Created page with " Back to Chapter 10" current
- 01:15, 21 September 2020 diff hist +24 N 10.3 Created page with " Back to Chapter 10" current
- 01:13, 21 September 2020 diff hist +23 N 7.43 Created page with " Back to Chapter 7" current
- 01:13, 21 September 2020 diff hist +23 N 7.41 Created page with " Back to Chapter 7" current
- 01:13, 21 September 2020 diff hist +23 N 7.39 Created page with " Back to Chapter 7" current
- 01:12, 21 September 2020 diff hist +3,727 N 7.37 Created page with "Proof by induction. A tournament with 2 vertices (1,2) has a Hamiltonian path. 1 -> 2 or vice versa Now suppose our tournament with n vertices has a Hamiltonian path 1,..,n...." current
- 01:11, 21 September 2020 diff hist +23 N 7.35 Created page with " Back to Chapter 7" current