Bounded Arithmetic, Propositional Logic and Complexity Theory - Encyclopedia of Mathematics and its Applications - Krajicek, Jan (Academy of Sciences of the Czech Republic, Prague) - Books - Cambridge University Press - 9780521452052 - November 24, 1995
In case cover and title do not match, the title is correct

Krajicek, Jan (Academy of Sciences of the Czech Republic, Prague)
Bounded Arithmetic, Propositional Logic and Complexity Theory - Encyclopedia of Mathematics and its Applications

Price
$ 183.99
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jun 3 - 15

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

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.

360 pages, references, index

Media Books     Hardcover Book   (Book with hard spine and cover)
Released November 24, 1995
ISBN13 9780521452052
Publishers Cambridge University Press
Pages 360
Dimensions 236 × 159 × 31 mm   ·   672 g
Language English  
Series Editor Doran, B.
Series Editor Flajolet, Philippe
Series Editor Ismail, M.
Series Editor Lam, T. Y.
Series Editor Lutwak, E.
Series Editor Rota, Gian-carlo
Series Editor Wutwak, E.

Mere med samme udgiver

See all of Krajicek, Jan (Academy of Sciences of the Czech Republic, Prague) ( e.g. Hardcover Book )