Vetenskap & teknik
Bounded Arithmetic, Propositional Logic and Complexity Theory
Jan Krajicek • Jan Krajicek • G-C Rota • B Doran
Inbunden
2249:-
Uppskattad leveranstid 5-10 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
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.
- Format: Inbunden
- ISBN: 9780521452052
- Språk: Engelska
- Antal sidor: 360
- Utgivningsdatum: 1995-11-24
- Förlag: Cambridge University Press