Bounded Arithmetic, Propositional Logic and Complexity Theory
Jan (Academy of Sciences of the Czech Republic, Prague) Krajicek
Cambridge University Press, 1995
213,25 €On orderDelivery: 2-3 weeks
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.
- ISBN-13
- 9780521452052
- ISBN-10
- 0521452058
- Publisher
- Cambridge University Press
- Year
- 1995
- Publication date
- 1995-11-24
- Pages
- 360
- Dimensions
- 159x236x31
- Weight
- 672