Date & Time:
January 15, 2019 3:30 pm – 4:30 pm
Location:
Ryerson 251, 1100 E. 58th St., Chicago, IL,
01/15/2019 03:30 PM 01/15/2019 04:30 PM America/Chicago Dimitry Sokolov (KTH) – Monotone Circuit Lower Bounds from Resolution Ryerson 251, 1100 E. 58th St., Chicago, IL,

Monotone Circuit Lower Bounds from Resolution

For any unsatisfiable CNF formula F that is hard to refute in the Resolution proof system, we show that a gadget-composed version of F is hard to refute in any proof system whose lines are computed by efficient communication protocols — or, equivalently, that a monotone function associated with F has large monotone circuit complexity. Our result extends to monotone real circuits, which yields new lower bounds for the Cutting Planes proof system.

As an application, we show that a monotone version of the XOR SAT function has exponential monotone circuit complexity. Since XOR-SAT is in NC^2, this improves qualitatively on the monotone vs. non-monotone separation of Tardos (1988). Another corollary is that monotone span programs can be exponentially more powerful than monotone circuits.

Host: Department of Computer Science & Mathematics Combinatorics & Theory Seminar

Dimitry Sokolov

Postdoctoral Scholar, KTH Royal Institute of Technology

Research interests:
Proof complexity, communication complexity, structural complexity, algorithms.
 

Related News & Events

Students posing at competition
No Name

UChicago Undergrad Team Places Second Overall In Regionals For World’s Largest Programming Competition

Mar 17, 2023
Haifeng Xu
No Name

New CS and DSI Faculty Haifeng Xu Brings Strategic Intelligence to NeurIPS 2022

Nov 28, 2022
No Name

UChicago CS Research Finds New Angle on Database Query Processing with Geometry

Nov 08, 2022
No Name

Asst. Prof. Aloni Cohen Receives Award For Revealing Flaws in Deidentifying Data

Sep 09, 2022
No Name

UChicago Hosts NSF Workshop on Frontiers of Quantum Advantage

Aug 15, 2022
No Name

New 2022-23 Faculty Add Expertise in Linguistics, Visualization, Economics, and Data Science Education

Aug 11, 2022
No Name

UChicago Co-Leads $10 Million NSF Institute on Foundations of Data Science

Aug 09, 2022
No Name

Bill Fefferman Comments on New Standards for Quantum-Proof Cryptography

Jul 07, 2022
No Name

UChicago London Colloquium Features Data Science, Quantum Research

Jul 01, 2022
No Name

Faculty Bill Fefferman and Chenhao Tan Receive Google Research Scholar Awards

Jun 21, 2022
No Name

First-Year PhD Student Co-Authors Outstanding Paper Award Winner at TQC 2022

Apr 28, 2022
No Name

Quanta Magazine Features Prof. Bill Fefferman’s Work on Quantum Algorithms

Jan 20, 2022
arrow-down-largearrow-left-largearrow-right-large-greyarrow-right-large-yellowarrow-right-largearrow-right-smallbutton-arrowclosedocumentfacebookfacet-arrow-down-whitefacet-arrow-downPage 1CheckedCheckedicon-apple-t5backgroundLayer 1icon-google-t5icon-office365-t5icon-outlook-t5backgroundLayer 1icon-outlookcom-t5backgroundLayer 1icon-yahoo-t5backgroundLayer 1internal-yellowinternalintranetlinkedinlinkoutpauseplaypresentationsearch-bluesearchshareslider-arrow-nextslider-arrow-prevtwittervideoyoutube