Laboratory of Mathematical Logic at PDMI

Вторник, 12 сентября, комната 106. Начало в 12:00.

Докладчик: Б. Ю. Конев.

доклад по статье П.Пудлака
LOWER BOUNDS FOR RESOLUTION AND CUTTING PLANE PROOFS AND MONOTONE COMPUTATIONS
Абстракт статьи:
We prove an exponential lower bound on the length of cutting plane proofs. The proof uses an extension of a lower bound for monotone circuits to circuits which compute with real numbers and use nondecreasing functions as gates. the latter result is of independent integers, since, in particular, it implies an exponential lower bound for some arithmetic circuits.