Abstract
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise class equation image?For concrete languages L and concrete promise classes equation image , these questions have been intensively studied during the last years, and a number of characterizations have been obtained. Here we provide new characterizations for Q1 and Q2 that apply to almost all promise classes equation image and languages L, thus creating a unifying framework for the study of these practically relevant questions. While questions Q1 and Q2 are left open by our results, we show that they receive affirmative answers when a small amount of advice is available in the underlying machine model. For promise classes with promise condition in equation imageequation image, the advice can be replaced by a tally equation image-oracle. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim