PROOF COMPLEXITY
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10401461" target="_blank" >RIV/00216208:11320/19:10401461 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
PROOF COMPLEXITY
Original language description
This book is a publication of Cambridge University Press as an item from the series Encyclopedia of Mathematics and its Applications", and it is really an encyclopedia of propositional proof complexity. Propositional proof complexity (or, simply, proof complexity) is one of the research areas tightly connecting mathematical logic and computational complexity theory.
Czech name
—
Czech description
—
Classification
Type
B - Specialist book
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
ISBN
978-1-108-41684-9
Number of pages
530
Publisher name
Cambridge University Press
Place of publication
Velká Británie
UT code for WoS book
—