14.0%OFF
Download App
| >> | LShop | >> | Book | >> | Reference, Informati... | >> | Encyclopaedias & Ref... | >> | Theory Of Computatio... |
14.0%OFF
Theory of Computational Complexity
-
ISBN
:
9780471345060
-
Publisher
:
Wiley-Interscience
-
Subject
:
Encyclopaedias & Reference Works
-
Binding
:
Hardcover
₹
17231.0
14.0% OFF
₹
14818.0
14818.0
Buy Now
Shipping charges are applicable for books below Rs. 101.0
View Details(Imported Edition) Estimated Shipping Time : 15-18 Business Days
View Details
-
Description
A complete treatment of fundamentals and recent advances in complexity theory Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity theory, including fundamental topics as well as recent breakthroughs not previously available in book form. Theory of Computational Complexity offers a thorough presentation of the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization, and the application to cryptography. It also examines the theory of nonuniform computational complexity, including the computational models of decision trees and Boolean circuits, and the notion of polynomial-time isomorphism. The theory of probabilistic complexity, which studies complexity issues related to randomized computation as well as interactive proof systems and probabilistically checkable proofs, is also covered. Extraordinary in both its breadth and depth, this volume:* Provides complete proofs of recent breakthroughs in complexity theory* Presents results in well-defined form with complete proofs and numerous exercises* Includes scores of graphs and figures to clarify difficult materialAn invaluable resource for researchers as well as an important guide for graduate and advanced undergraduate students, Theory of Computational Complexity is destined to become the standard reference in the field.
-
Author Biography
DING-ZHU DU, PhD, is a professor in the Department of Computer Science at the University of Minnesota. KER-I KO, PhD, is a professor in the Department of Computer Science at the State University of New York at Stony Brook.
Related Items
-
of
-
OFFER
Problem Solving in Automata, Languages, and Complexity
Ding-zhu Du
Starts At
11223.0
13051.0
14% OFF
-
OFFER
Problem Solving in Automata, Languages, and Complexity 1st Edition
Ding-Zhu Du
Starts At
12087.0
14923.0
19% OFF
-
OFFER
The Penguin Dictionary of Literary Terms and Literary Theory (Penguin Dictionary)
J. A. Cuddon
Starts At
412.0
550.0
25% OFF
-
OFFER
Spiritual Authority and Temporal Power in the Indian Theory of Government
Ananda K. Coomaraswamy
Starts At
415.0
500.0
17% OFF
-
OFFER
Fundamentals Of Queueing Theory, 3Rd Ed
Carl M. Harris Donald Gross
Starts At
600.0
682.0
12% OFF
-
OFFER
Formal Languages And Automata Theory
Karibasappa K. G. Basavaraj S. Anami
Starts At
472.0
569.0
17% OFF
-
OFFER
Strategic Management: Theory and Practice (Biztantra)
John Parnell
Starts At
296.0
349.0
15% OFF
-
OFFER
An Introduction To Probability Theory And Its Applications
William Feller
Starts At
597.0
679.0
12% OFF
-
OFFER
An Introduction To Probability: Theory And Its Applications
William Feller
Starts At
560.0
719.0
22% OFF
-
OFFER
Antenna Theory: Analysis And Design (With CD)
Constantine A. Balanis
Starts At
671.0
819.0
18% OFF
