图 书 馆
命题证明复杂性Propositional Proof Complexity |
|
| 课程网址: | https://videolectures.net/8ecm2021_razborov_proof_complexity/ |
| 主讲教师: | Alexander Razborov |
| 开课单位: | 8ECM会议 |
| 开课时间: | 2021-07-06 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Propositional proof complexity studies efficient provability of statements that can be expressed in quantifier-free form, in various proof systems and under various notions of “efficiency”. Statements of interest come from a variety of sources that, besides traditional combinatorial principles and other mathematical theorems, include areas like combinatorial optimization, practical SAT solving and operation research. While many proof systems considered in the modern proof complexity are still traditional, in the sense that they are Hilbert-style and logic-based, a considerable amount of attention has been in recent years paid to systems modelling algebraic and semi-algebraic reasoning, including elementary convex geometry. In this talk I will attempt to convey some basic ideas underlying this vibrant area, including a necessarily based sample of illustrating examples. |
| 关 键 词: | 命题证明; 无量词表示; 组合原理 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2024-05-28：liyq |
| 最后编审: | 2024-05-28：liyq |
| 阅读次数: | 4 |