
Forcing with Random Variables and Proof Complexity
Jan Krajicek
₹4,475

by Jan Krajicek, G. -C Rota, B. Doran
Free delivery. Nothing extra to pay at checkout.
This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and complexity theory and lists a number of intriguing open problems.
Description supplied by the publisher.