作者
Stephen Cook, Phuong Nguyen
发表日期
2010/1/25
卷号
11
出版商
Cambridge University Press
简介
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. The result is a uniform treatment of many systems in the literature.
引用总数
200620072008200920102011201220132014201520162017201820192020202120222023202436789232523191520201812161013209
学术搜索中的文章
S Cook, P Nguyen - 2010
S Cook, P Nguyen - Bounded Arithmetic and Propositional Translations, 2006