
Bounded Arithmetic, Propositional Logic and Complexity Theory
Krajicek, Jan
I salg
Leveringstid: 7-30 dager
Handlinger
Beskrivelse
Omtale
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.
-
Utgivelsesdato:
24.11.1995
-
ISBN/Varenr:
9780521452052
-
Språk:
Engelsk
-
Forlag:
Cambridge University Press
-
Innbinding:
Innbundet
-
Fagtema:
Matematikk og naturvitenskap
-
Serie:
Encyclopedia of Mathematics and its Applications
-
Litteraturtype:
Faglitteratur
-
Sider:
360
-
Høyde:
15.9 cm
-
Bredde:
23.6 cm