Bounded Arithmetic, Propositional Logic and Complexity Theory
by
Jan Krajicek
Book Details
Format
Hardback or Cased Book
Book Series
Encyclopedia of Mathematics and its Applications
ISBN-10
0521452058
ISBN-13
9780521452052
Publisher
Cambridge University Press
Imprint
Cambridge University Press
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Nov 24th, 1995
Print length
360 Pages
Weight
672 grams
Dimensions
15.90 x 23.60 x 3.10 cms
Product Classification:
Mathematical logicMathematical theory of computation
Ksh 24,100.00
Manufactured on Demand
Delivery in 29 days
Delivery Location
Delivery fee: Select location
Delivery in 29 days
Secure
Quality
Fast
An up-to-date, unified treatment of research in this interdisciplinary subject, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and computational complexity theory and lists a number of intriguing open problems.
Get Bounded Arithmetic, Propositional Logic and Complexity Theory by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Cambridge University Press and it has pages.
