Jan (Academy of Sciences of the Czech Republic Krajicek Forfatter

Visning: Type : Bog | Sprog : Alle | Format : Alle Der vises kun bøger

• 

  PRIS

  1.644,- kr

  FRAGTFRI LEVERING

  Levering: Print on Demand (forvent 14 - 30 hverdage)

  Bemærk: Kan ikke leveres før jul.

  Bounded Arithmetic, Propositional Logic and Complexity Theory (Bog, Hardback, Engelsk)

  Af: Jan (Academy of Sciences of the Czech Republic Krajicek

  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.

  PRIS

  1.644,- kr

  FRAGTFRI LEVERING

  Levering: Print on Demand (forvent 14 - 30 hverdage)

  Læg i kurv