Udvidet returret til d. 31. januar 2025

Bounded Arithmetic, Propositional Logic and Complexity Theory - Jan (Academy of Sciences of the Czech Republic Krajicek - Bog

Bag om Bounded Arithmetic, Propositional Logic and Complexity Theory

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.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9780521452052
  • Indbinding:
  • Hardback
  • Sideantal:
  • 360
  • Udgivet:
  • 24. november 1995
  • Størrelse:
  • 236x159x31 mm.
  • Vægt:
  • 672 g.
  • 8-11 hverdage.
  • 7. december 2024

Normalpris

  • BLACK NOVEMBER

Medlemspris

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Beskrivelse af Bounded Arithmetic, Propositional Logic and Complexity Theory

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.

Brugerbedømmelser af Bounded Arithmetic, Propositional Logic and Complexity Theory



Find lignende bøger
Bogen Bounded Arithmetic, Propositional Logic and Complexity Theory findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.