A note on semantic cutting planes

  • Pavel Hrubes
  • Published 2013 in Electronic Colloquium on Computational Complexity

Abstract

We show that the semantic cutting planes proof system has feasible interpolation via monotone real circuits. This gives an exponential lower bound on proof length in the system, answering a question from [5]. We also pose the following problem: can every multivariate non-decreasing function be expressed as a composition of non-decreasing functions in two… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics