Using a balanced approach that is partly algorithmic and partly structuralist, this book systematically reviews the most significant results obtained in the study of computational complexity theory. KEY TOPICS: Considers properties of complexity classes, inclusions between classes, implications between several hypotheses about complexity classes, and identification of structural properties of sets that affect their computational complexity. Features over 120 worked examples, over 200 problems, and 400 figures. For those interested in complexity and computability, algorithm design, operations research, and combinational mathematic.

1.Mathematical preliminaries 2.Elements of computacility theory 3.Complexity classes 4.The class P 5.The calss NP 6.The complexity of optimization problems 7.Beyond NP 8.Space-complexity classes 9.Probability algorithms and complexity calsses 10.Interactive proof systems 11.Models of pafallel computers 12.Parallel apgorithms

등록된 사용후기

사용후기 쓰기 새 창 더보기

사용후기가 없습니다.

등록된 상품문의

상품문의 쓰기새 창 더보기

상품문의가 없습니다.

배송정보

교환/반품 정보