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

by Jan Krajíček, G. -C Rota, B. Doran
Cambridge University Press · 1995
Free delivery. Nothing extra to pay at checkout.
Published by Cambridge University Press in 1995, Bounded Arithmetic, Propositional Logic and Complexity Theory by Jan Krajíček, G. -C Rota & others runs to 343 pages. It belongs to the Encyclopedia of mathematics and its applications series.
Its main subjects are Computational complexity, Proposition (Logic) and Constructive mathematics.