The Mathematics of P vs NP by hemant pandey - HTML preview
PLEASE NOTE: This is an HTML preview only and some elements such as links or page numbers may be incorrect.
Download the book in PDF, ePub, Kindle for a complete version.
Download the book in PDF, ePub, Kindle for a complete version.
1. INTRODUCTION
Computation complexity had its seeds sown way back in 1936 when Turing developed his theoretical computational model. Further developments resulted in 1960’s by Hartmanis and Stearns when they coined the idea to measure time and space as a function of the length of the input.