An applicative theory for FPH
Logic in Computer Science
2011-01-31 v1 Computational Complexity
Abstract
In this paper we introduce an applicative theory which characterizes the polynomial hierarchy of time.
Cite
@article{arxiv.1101.5444,
title = {An applicative theory for FPH},
author = {Reinhard Kahle and Isabel Oitavem},
journal= {arXiv preprint arXiv:1101.5444},
year = {2011}
}
Comments
In Proceedings CL&C 2010, arXiv:1101.5200