Language:

On semantic cutting planes with very small coefficients

Lauria, Massimo ; Thapen, Neil

Information processing letters, 2018-08, Vol.136, p.70-75 [Peer Reviewed Journal]

Full text available

Citations Cited by

Title:
On semantic cutting planes with very small coefficients
Author: Lauria, Massimo ; Thapen, Neil
Subjects: Cutting planes ; Proof complexity ; Theory of computation
Is Part Of: Information processing letters, 2018-08, Vol.136, p.70-75
Description: Cutting planes proofs for integer programs can naturally be defined both in a syntactic and in a semantic fashion. Filmus et al. (STACS 2016) proved that semantic cutting planes proofs may be exponentially stronger than syntactic ones, even if they use the semantic rule only once. We show that when semantic cutting planes proofs are restricted to have coefficients bounded by a function growing slowly enough, syntactic cutting planes can simulate them efficiently. Furthermore if we strengthen the restriction to a constant bound, then the simulating syntactic proof even has polynomially small coefficients. •Semantic cutting planes proofs are stronger than syntactic one [FHL'16].•If coefficients in the semantic proof are small enough, we can efficiently simulate it with a syntactic proof.•We prove an efficient form of implicational completeness, with respect to coefficient size.
Publisher: Elsevier B.V
Language: English

Back to results list

Previous Result 15 Next Go to Next page