The increased focus on heuristics for the approximate solution of integer programs has led to more sophisticated analysis methods for studying their performance. This paper is concerned with the worst ...

Algorithm design strategies such as divide and conquer. Elementary techniques for analysis; asymptotic analysis, recursion equations, estimation methods, elementary combinatorial arguments.

Complexity Theory and Polynomial Time Algorithms Publication Trend The graph below shows the total number of publications each year in Complexity Theory and Polynomial Time Algorithms.

Complexity Theory: The study of the intrinsic difficulty of computational problems and the classification of algorithms according to the resources required for their solution.

Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study optimization. This course provides an introduction to algorithm design ...

He is the author of the multi-volume work, the magnum opus, The Art of Computer Programming. He made several key contributions to the rigorous analysis of the computational complexity of algorithms.

How We Analyzed the COMPAS Recidivism Algorithm by Jeff Larson, Surya Mattu, Lauren Kirchner and Julia Angwin May 23, 2016 ...

Tony F. Chan, Gene H. Golub, Randall J. LeVeque, Algorithms for Computing the Sample Variance: Analysis and Recommendations, The American Statistician, Vol. 37, No. 3 ...