On the Computational Complexity of the Theory of Complete Binary Trees

Acta Mathematica Sinica, Chinese Series ›› 2008, Vol. 51 ›› Issue (2) : 311-318.

PDF(524 KB)
中国科学院数学与系统科学研究院期刊网
PDF(524 KB)
Acta Mathematica Sinica, Chinese Series ›› 2008, Vol. 51 ›› Issue (2) : 311-318. DOI: 10.12386/A2008sxxb0036
论文

On the Computational Complexity of the Theory of Complete Binary Trees

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Acta Mathematica Sinica, Chinese Series, 2008, 51(2): 311-318 https://doi.org/10.12386/A2008sxxb0036

References

Publishing order | Descend order by publishing year | Descend order by cited within

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(524 KB)

Accesses

Citation

Detail
Sections
Recommended

/

〈 〉