On Optimal Algorithms and Optimal Proof Systems

@inproceedings{Messner1999OnOA,
  title={On Optimal Algorithms and Optimal Proof Systems},
  author={Jochen Messner},
  booktitle={STACS},
  year={1999}
}
A deterministic algorithm O accepting a language L is called (polynomially) optimal if for any algorithm A accepting L there is a polynomial p such that time O (x) p(jxj+ time A (x)) for every x 2 L. It is shown that an optimal acceptor for a language L exists if there is a p-optimal proof system for L. If L is a p-cylinder also the inverse implication holds. This result widely generalizes work from Kraj cek and Pudll ak who showed the result for L = TAUT. It is further shown how to construct… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…