CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt155",{id:"formSmash:upper:j_idt155",widgetVar:"widget_formSmash_upper_j_idt155",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt159_j_idt161",{id:"formSmash:upper:j_idt159:j_idt161",widgetVar:"widget_formSmash_upper_j_idt159_j_idt161",target:"formSmash:upper:j_idt159:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Lifting with Simple Gadgets and Applications to Circuit and Proof ComplexityPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true}); PrimeFaces.cw("SelectBooleanButton","widget_formSmash_j_idt296",{id:"formSmash:j_idt296",widgetVar:"widget_formSmash_j_idt296",onLabel:"Hide others and affiliations",offLabel:"Show others and affiliations"});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
(English)Manuscript (preprint) (Other academic)
##### Abstract [en]

##### National Category

Computer Sciences
##### Research subject

Computer Science
##### Identifiers

URN: urn:nbn:se:kth:diva-249607OAI: oai:DiVA.org:kth-249607DiVA, id: diva2:1304720
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt523",{id:"formSmash:j_idt523",widgetVar:"widget_formSmash_j_idt523",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt529",{id:"formSmash:j_idt529",widgetVar:"widget_formSmash_j_idt529",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt535",{id:"formSmash:j_idt535",widgetVar:"widget_formSmash_j_idt535",multiple:true});
##### Note

##### In thesis

We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in particular, for useful gadgets such as equality and greater-than. We apply our generalized theorem to solve two open problems:

- We present the first result that demonstrates a separation in proof power for cutting planes with unbounded versus polynomially bounded coefficients. Specifically, we exhibit CNF formulas that can be refuted in quadratic length and constant line space in cutting planes with unbounded coefficients, but for which there are no refutations in subexponential length and subpolynomialline space if coefficients are restricted to be of polynomial magnitude.

- We give the first explicit separation between monotone Boolean formulas and monotone real formulas. Specifically, we give an explicit family of functions that can be computed with monotone real formulas of nearly linear size but require monotone Boolean formulas of exponential size. Previously only a non-explicit separation was known.

An important technical ingredient, which may be of independent interest, is that we show that the Nullstellensatz degree of refuting the pebbling formula over a DAG G over any field coincides exactly with the reversible pebbling price of G. In particular, this implies that the standard decision tree complexity and the parity decision tree complexity of the corresponding falsified clause search problem are equal.

QC 20190529

Available from: 2019-04-12 Created: 2019-04-12 Last updated: 2019-05-29Bibliographically approved1. Lower Bounds and Trade-offs in Proof Complexity$(function(){PrimeFaces.cw("OverlayPanel","overlay1318061",{id:"formSmash:j_idt841:0:j_idt848",widgetVar:"overlay1318061",target:"formSmash:j_idt841:0:parentLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1519",{id:"formSmash:j_idt1519",widgetVar:"widget_formSmash_j_idt1519",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1573",{id:"formSmash:lower:j_idt1573",widgetVar:"widget_formSmash_lower_j_idt1573",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1574_j_idt1578",{id:"formSmash:lower:j_idt1574:j_idt1578",widgetVar:"widget_formSmash_lower_j_idt1574_j_idt1578",target:"formSmash:lower:j_idt1574:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});