Norges billigste bøker

Arithmetic, Proof Theory, and Computational Complexity

Om Arithmetic, Proof Theory, and Computational Complexity

This book principally concerns the area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. This includes an open problem list of 7 fundamental and 39 technical questions together with a bibliography of references.

Vis mer
  • Språk:
  • Engelsk
  • ISBN:
  • 9780198536901
  • Bindende:
  • Hardback
  • Sider:
  • 442
  • Utgitt:
  • 6 mai 1993
  • Dimensjoner:
  • 162x242x30 mm.
  • Vekt:
  • 810 g.
  Gratis frakt
Leveringstid: 2-4 uker
Forventet levering: 26 oktober 2024

Beskrivelse av Arithmetic, Proof Theory, and Computational Complexity

This book principally concerns the area of "Logical Complexity Theory", the study of bounded arithmetic, propositional proof systems, length of proof, etc and relations to computational complexity theory. This includes an open problem list of 7 fundamental and 39 technical questions together with a bibliography of references.

Brukervurderinger av Arithmetic, Proof Theory, and Computational Complexity



Finn lignende bøker
Boken Arithmetic, Proof Theory, and Computational Complexity finnes i følgende kategorier:

Gjør som tusenvis av andre bokelskere

Abonner på vårt nyhetsbrev og få rabatter og inspirasjon til din neste leseopplevelse.