Bounded Arithmetic, Propositional Logic and Complexity Theory
Inbunden, Engelska, 1995
Av Prague) Krajicek, Jan (Academy of Sciences of the Czech Republic, Jan Krajicek, G. -C Rota, B. Doran
2 309 kr
Beställningsvara. Skickas inom 7-10 vardagar
Fri frakt för medlemmar vid köp för minst 249 kr.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.
Produktinformation
- Utgivningsdatum1995-11-24
- Mått236 x 159 x 31 mm
- Vikt672 g
- FormatInbunden
- SpråkEngelska
- SerieEncyclopedia of Mathematics and its Applications
- Antal sidor360
- FörlagCambridge University Press
- ISBN9780521452052