Counting Workflow Satisfiability(≠,=) and Its #P Completeness

ZHAI Zhi-nian, LU Ya-hui, YU Fa-hong, ZHOU Wu-jie, XIANG Jian, WU Ming-wei

ACTA ELECTRONICA SINICA ›› 2017, Vol. 45 ›› Issue (3) : 605-611.

PDF(1360 KB)
CIE Homepage  |  Join CIE  |  Login CIE  |  中文 
PDF(1360 KB)
ACTA ELECTRONICA SINICA ›› 2017, Vol. 45 ›› Issue (3) : 605-611. DOI: 10.3969/j.issn.0372-2112.2017.03.015

Counting Workflow Satisfiability(≠,=) and Its #P Completeness

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

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}}[J]. {{journal.qiKanMingCheng_EN}}, 2017, 45(3): 605-611. https://doi.org/10.3969/j.issn.0372-2112.2017.03.015

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(1360 KB)

Accesses

Citation

Detail
Sections
Recommended
Copyright © ACTA ELECTRONICA SINICA, All Rights Reserved.
E-mail：new@ejournal.org.cn
Powered by Beijing Magtech Co. Ltd,.
Copyright © ACTA ELECTRONICA SINICA, All Rights Reserved.

/

〈 〉