Complexity of Algorithms: Lecture Notes, Spring 1999

Main
Computers - Computer Science
Complexity of Algorithms: Lecture...

Complexity of Algorithms: Lecture Notes, Spring 1999

Peter Gács, László Lovász

0 / 0

0 comments

Bạn thích cuốn sách này tới mức nào?

Chất lượng của file scan thế nào?

Xin download sách để đánh giá chất lượng sách

Chất lượng của file tải xuống thế nào?

The need to be able to measure the complexity of a problem, algorithm or structure, and to obtain bounds and quantitive relations for complexity arises in more and more sciences: besides computer science, the traditional branches of mathematics, statistical physics, biology, medicine, social sciences and engineering are also confronted more and more frequently with this problem. In the approach taken by computer science, complexity is measured by the quantity of computational resources (time, storage, program, communication) used up by a particualr task. These notes deal with the foundations of this theory.

Thể loại:

Computers - Computer Science

Năm:

1999

Nhà xuát bản:

Boston University

Ngôn ngữ:

english

Trang:

180

File:

PDF, 808 KB