Bounded Arithmetic, Propositional Logic and Complexity Theory - Krajicek, Jan (Academy of Sciences of the Czech Republic, Prague)
96,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 1-2 Wochen
payback
48 °P sammeln
  • Gebundenes Buch

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.

Andere Kunden interessierten sich auch für
Produktbeschreibung
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.