Proof Complexity (Encyclopedia of Mathematics and its Applications)
Jan Krajíček
Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. Suitable for doctoral students and researchers in mathematics and theoretical computer science.
Категорії:
Рік:
2019
Видання:
1
Видавництво:
Cambridge University Press
Мова:
english
Сторінки:
530
ISBN 10:
1108416845
ISBN 13:
9781108416849
Серії:
Encyclopedia of Mathematics and its Applications (Book 170)
Файл:
PDF, 2.30 MB
IPFS:
,
english, 2019