ECCC-Report TR19-186https://eccc.weizmann.ac.il/report/2019/186Comments and Revisions published for TR19-186en-usTue, 25 Feb 2020 14:22:18 +0200
Revision 4
| Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity |
Susanna de Rezende,
Or Meir,
Jakob Nordström,
Toniann Pitassi,
Robert Robere,
Marc Vinyals
https://eccc.weizmann.ac.il/report/2019/186#revision4We 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 subpolynomial line 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.Tue, 25 Feb 2020 14:22:18 +0200https://eccc.weizmann.ac.il/report/2019/186#revision4
Revision 3
| Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity |
Susanna de Rezende,
Or Meir,
Jakob Nordström,
Robert Robere,
Toniann Pitassi,
Marc Vinyals
https://eccc.weizmann.ac.il/report/2019/186#revision3We 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 subpolynomial line 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.Tue, 25 Feb 2020 14:21:58 +0200https://eccc.weizmann.ac.il/report/2019/186#revision3
Revision 2
| Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity |
Or Meir,
Susanna F. de Rezende,
Jakob Nordström,
Robert Robere,
Toniann Pitassi
https://eccc.weizmann.ac.il/report/2019/186#revision2We 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 subpolynomial line 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.Tue, 07 Jan 2020 15:12:30 +0200https://eccc.weizmann.ac.il/report/2019/186#revision2
Revision 1
| Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity |
Or Meir,
Susanna F. de Rezende,
Jakob Nordström,
Robert Robere,
Toniann Pitassi,
Marc Vinyals
https://eccc.weizmann.ac.il/report/2019/186#revision1We 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 subpolynomial line 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.Tue, 31 Dec 2019 18:53:45 +0200https://eccc.weizmann.ac.il/report/2019/186#revision1
Paper TR19-186
| Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity |
Or Meir,
Susanna de Rezende,
Jakob Nordström,
Robert Robere,
Toniann Pitassi
https://eccc.weizmann.ac.il/report/2019/186We 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 subpolynomial line 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.Tue, 31 Dec 2019 18:41:23 +0200https://eccc.weizmann.ac.il/report/2019/186