
Computational Complexity of Counting and Sampling
Istvan Miklos
₹6,549

by Clote, Krajicek, Peter Clote
OUP Oxford · 1993
Free delivery. Nothing extra to pay at checkout.
Arithmetic, Proof Theory, and Computational Complexity is written by Clote, Krajicek & others. This edition from OUP Oxford (1993) has 428 pages. It belongs to the Oxford logic guides series.
The book deals with Computational complexity and Proof theory.