Theory of computational complexity

Theory of computational complexity Du and Ko present the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization.The 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

Authors: Du D.-Z., Ko K.-I.Pages: 253     Year: 2000

Tags: computational theory complexity

Customers who bought this item also bought:


© 2007–2020 Dleex.

English      German      French      Russian

For any question please write to our email e-mail