Bounded Arithmetic, Propositional Logic and Complexity Theory (Bog, Hardback, Engelsk)
  1. Forside
  2. Bøger
  3. Engelske bøger
  4. Matematisk logik
  5. Matematisk datateori
  6. Bounded Arithmetic, Propositional Logic and Complexity Theory

Bounded Arithmetic, Propositional Logic and Complexity Theory

(Bog, Hardback, Engelsk)
Forfatter: Jan (Academy of Sciences of the Czech Republic Krajicek
Bounded Arithmetic, Propositional Logic and Complexity Theory
Forlag: Cambridge University Press

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

Når du handler på WilliamDam.dk, betaler du den pris du ser.

  • Ingen gebyrer
  • Ingen abonnementer
  • Ingen bindingsperioder

Relaterede kategorier

Matematisk datateori Matematisk logik
  = Emner / kategorier
  = Sektioner / guides
  = Specialsider
  = Kampagner

Beskrivelse

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.

Læsernes anmeldelser (0)

Alle detaljer

Forlag Cambridge University Press
Forfatter Jan (Academy of Sciences of the Czech Republic Krajicek
Type Bog
Format Hardback
Sprog Engelsk
Udgivelsesdato 24-11-1995
Første udgivelsesår 1995
Serie Encyclopedia of Mathematics and its Applications
Originalsprog United Kingdom
Sideantal 360
Indbinding Hardback
Forlag Cambridge University Press
Sideoplysninger 360 pages
Mål 159 x 236 x 31
ISBN-13 / EAN-13 9780521452052