meaning they are computationally intractable and require exponential time. Polynomial time complexity is the most desirable for optimization problems, as the algorithm will run in a reasonable amount of time. The higher the complexity, the longer the runtime will be. ...
E. Sahaya Rose VigitaE. Golden JulieS. Tamil SelviInternational Conference on Artificial Intelligence and Evolutionary Algorithms in Engineering Systems