Bounded Arithmetic, Propositional Logic and Complexity Theory
Jan Krajíček, G. -C Rota, B. Doran
₹4,098
Forcing with Random Variables and Proof Complexity
by Jan Krajicek
Cambridge University Press · 2011
₹4,475
Free delivery. Nothing extra to pay at checkout.
- Delivery in 3–7 days to any serviceable pincode in India, with tracking.
- Cash on delivery. Pay when the parcel reaches you.
- 15-day returns. See what qualifies.
About this book
Forcing with Random Variables and Proof Complexity by Jan Krajicek is a 247-page book published by Cambridge University Press in 2011.
Topics covered include Computational complexity, Random variables, Mathematical analysis and Proof theory.
Book details
- ISBN-13
- 9780521154338
- ISBN-10
- 0521154332
- Author
- Jan Krajicek
- Publisher
- Cambridge University Press
- Published
- 2011
- Pages
- 247
- Language
- English
- Condition
- New
- Subject
- Computational complexity
More in Computational complexity
Computational Science and Its Applications - ICCSA 2005
Osvaldo Gervasi, Marina L. Gavrilova, Vipin Kumar
₹4,856
Randomness Through Computation
Hector Zenil
₹4,949
Deontic Logic in Computer Science
Jan M. Broersen
₹5,610
Applications of Fibonacci Numbers
Frederic T. Howard
₹8,155
Transactions on Computational Science XXIX
Marina L. Gavrilova, C. J. Kenneth Tan
₹4,214
Computability
B. Jack Copeland, Carl J. Posy, Oron Shagrir
₹2,740
Foundations of Generic Optimization, Volume 2
Robbert Lowen
₹1,647
The Nature of Computation Logic, Algorithms, Applications
Paola Bonizzoni
₹4,279
Fundamentals of Computation Theory
Olaf Owe, Martin Steffen, Jan Arne Telle
₹5,593
Combinatorial Network Theory
Ding-Zhu Du
₹7,754
Energy Transmission and Synchronization in Complex Networks
Nicolás Rubido
₹3,279