Question: Rll tht th dynmi progrmming lgorithm for TSP tks tim O(n22n) nd sp O(n2n). Suppos th onstnt ftors in ths running tims r tht it
Rll tht th dynmi progrmming lgorithm for TSP tks tim O(n22n) nd sp O(n2n). Suppos th onstnt ftors in ths running tims r tht it tks n22n/1010 sonds to run n instn of siz n, nd tht it uss 8n2n byts of mmory. How big problm n you solv in t most n hour on omputr with 4109 byts of mmory? Wht is th limiting ftor for this omputtion, tim or mmory?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
