De Aller-Bedste Bøger - over 12 mio. danske og engelske bøger
Levering: 1 - 2 hverdage

Bounded Arithmetic, Propositional Logic and Complexity Theory

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.
  • 11. december 2024
Forlænget returret til d. 31. januar 2025

Normalpris

Abonnementspris

- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding

Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.

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: