Extended Locally Definable Acceptance Types

Abstract

Hertrampf’s locally definable acceptance types showed that many complexity classes can be defined in terms of polynomially time bounded NTM’s with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths etc. We introduce extended locally definable acceptance types as a generalization of… (More)

Topics

Cite this paper

@inproceedings{Rossmanith2008ExtendedLD, title={Extended Locally Definable Acceptance Types}, author={Peter Rossmanith}, year={2008} }