NP Completeness- Analysis of Algorithm – In this post,failure stories of computer science are discussed.Can all computational problems be solved by a computer
difference between np hard and np complete
2 Articles
2
pseudo polynomial Algorithms – Analysis of Algorithm – An algorithm whose worst case time complexity depends on numeric value of input (not number of inputs)