J4 ›› 2012, Vol. 34 ›› Issue (9): 184-187.
• 论文 • Previous Articles Next Articles
LI Yarui
Received:
Revised:
Online:
Published:
Abstract:
It is discussed that a complexity resolution of the Polynomialtime Hierarchy based on the ΔPKcomplexity classes.Regarding that whether the polynomialtime Hierarchy has only finite levels or not,its two conditions are given.It is proved that the language classes constructed by sparse sets in NP is in LP2∧.
Key words: polynomialtime hierarchy;ΔPKcomplexity classes;Turing machine
LI Yarui. A Complexity Decomposition of the PolynomialTime Hierarchy[J]. J4, 2012, 34(9): 184-187.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://joces.nudt.edu.cn/EN/
http://joces.nudt.edu.cn/EN/Y2012/V34/I9/184
