On the existence of polynomial time algorithms for interpolation problems in propositional logic (original) (raw)

This paper investigates the complexity of interpolation problems in quantified propositional logic by relating them to the complexity hierarchies between deterministic logarithmic space and deterministic polynomial space. It defines the Σ(k)-INT and U(k)-INT interpolation problems, discusses their polynomial time computability, and provides various complexity measures. Furthermore, it presents conditions under which certain interpolation problems can be computed in polynomial time and explores the implications of these results on the broader class of interpolation problems.