Logical Foundations of Proof Complexity - Rilegato

Cook, Stephen; Nguyen, Phuong

Rilegato

ISBN 10: 052151729X ISBN 13: 9780521517294

Casa editrice: Cambridge University Press, 2010

Riassunto

A treatise on bounded arithmetic and propositional proof complexity by the leader in the field.

Su questo libro

Informazioni sugli autori

Stephen Cook is a professor at the University of Toronto. He is author of many research papers, including his famous 1971 paper 'The Complexity of Theorem Proving Procedures', and the 1982 recipient of the Turing Award. He was awarded a Steacie Fellowship in 1977 and a Killam Research Fellowship in 1982 and received the CRM/Fields Institute Prize in 1999. He is a Fellow of the Royal Society of London and the Royal Society of Canada and was elected to membership in the National Academy of Sciences (United States) and the American Academy of Arts and Sciences.

Phuong Nguyen (Nguyễn Thế Phương) received his MSc and PhD degrees from University of Toronto in 2004 and 2008 respectively. He has been awarded postdoctoral fellowships by the Eduard Čech Center for Algebra and Geometry (the Czech Republic) for 2008–9, and by the Natural Sciences and Engineering Research Council of Canada (NSERC), effective September 2009.

Dettagli dell'edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 2010
• Lingua: Inglese
• ISBN 10: 052151729X
• ISBN 13: 9780521517294
• Rilegatura: Copertina rigida
• Numero edizione: 1
• Numero di pagine: 496
• Contatto del produttore: non disponibile
• Persona responsabile: Avery; https://www.avery.fr/; ; chemin des peupliers 27; Dardilly; Francia