NP is not AL and P is not NC is not NL is not L
Computational Complexity
2011-11-22 v5
Abstract
This paper talk about that NP is not AL and P, P is not NC, NC is not NL, and NL is not L. The point about this paper is the depend relation of the problem that need other problem's result to compute it. I show the structure of depend relation that could divide each complexity classes.
Keywords
Cite
@article{arxiv.1110.0200,
title = {NP is not AL and P is not NC is not NL is not L},
author = {Koji Kobayashi},
journal= {arXiv preprint arXiv:1110.0200},
year = {2011}
}
Comments
7 pages, in English and Japanese