Vi bøger
Trustpilot
Levering: 1 - 2 hverdage
Hjælp
Login
  1. Forside
  2. Bøger
  3. Business og læring
  4. Arithmetic, Proof Theory, and Computational Complexity

Arithmetic, Proof Theory, and Computational Complexity - Bog

indgår i Oxford Logic Guides serien

Arithmetic, Proof Theory, and Computational Complexity
Bag 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 mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9780198536901
  • Indbinding:
  • Hardback
  • Sideantal:
  • 442
  • Udgivet:
  • 6. Maj 1993
  • Størrelse:
  • 162x242x30 mm.
  • Vægt:
  • 810 g.
  • 2-3 uger.
  • 19. Oktober 2024
På lager

Normalpris

Medlemspris

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

Beskrivelse af 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.

Brugerbedømmelser af Arithmetic, Proof Theory, and Computational Complexity



Andre købte også..
Find lignende bøger
Bogen Arithmetic, Proof Theory, and Computational Complexity 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.