Theory of computational complexity

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Du and Ko present the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization.The book...is a graduate text...however, it can also be used profitably by researchers in theory...the selection by the authors of the book under review is excellent

Author(s): Ding-Zhu Du, Ker-I Ko
Publisher: Wiley
Year: 2000

Language: English
Pages: 253
City: New York
Tags: Информатика и вычислительная техника;Теория алгоритмов;