http://www.eatcs.org.../citation08.pdf
The citation for the Godel prize this year looks extremely interesting. We learn algorithms complexity from the first course on algorithms and data structures and we are told that complexity should tell us how fast the algorithms runs. Unfortunately, this is true only theoretically. Even the average case does not predict well the algorithms in reality. The prize winners this year developed a method to understand the seem-to-be wild behaviour of algorithms. The example is the simplex method which is basic but very effective in optimization.
1 người đang xem chủ đề
0 thành viên, 1 khách, 0 thành viên ẩn danh
