A note on the size of Craig Interpolants

Authors Uwe Schöning, Jacobo Torán

Thumbnail PDF


  • Filesize: 143 kB
  • 9 pages

Document Identifiers

Author Details

Uwe Schöning
Jacobo Torán

Cite AsGet BibTex

Uwe Schöning and Jacobo Torán. A note on the size of Craig Interpolants. In Circuits, Logic, and Games. Dagstuhl Seminar Proceedings, Volume 6451, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


Mundici considered the question of whether the interpolant of two propositional formulas of the form $F ightarrow G$ can always have a short circuit description, and showed that if this is the case then every problem in NP $cap$ co-NP would have polynomial size circuits. In this note we observe further consequences of the interpolant having short circuit descriptions, namely that UP $subseteq$ P$/$poly, and that every single valued NP function has a total extension in FP$/$poly. We also relate this question with other Complexity Theory assumptions.
  • Interpolant
  • non-uniform complexity


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads