多项式时间归约 (Chinese Wikipedia)
Analysis of information sources in references of the Wikipedia article "多项式时间归约" in Chinese language version.
refsWebsite
Global rank
Chinese rank
1st place
1st place
low place
low place
5th place
12th place
cnki.net
kns.cnki.net
- 黄文奇; 陈志祥. 递归集的k-1-度上半格的不可补性与不可分配性. 数学学报. 1989-08-29, (04): 517-524 [2022-08-11]. ISSN 0583-1431. （原始内容存档于2022-08-11） （中文（中国大陆））.
dagstuhl.de
drops.dagstuhl.de
- Mandal, Debasis; Pavan, A.; Venugopalan, Rajeswari. Separating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis. 34th International Conference on Foundation of Software Technology and Theoretical Computer Science. 2014 [2022-08-11]. ISBN 978-3-939897-77-4. （原始内容存档于2022-06-17）.
doi.org
- Buss, S.R.; Hay, L., On truth-table reducibility to SAT and the difference hierarchy over NP, Proceedings of Third Annual Structure in Complexity Theory Conference: 224–233, 1988, CiteSeerX 10.1.1.5.2387
, ISBN 978-0-8186-0866-7, doi:10.1109/SCT.1988.5282.
psu.edu
citeseerx.ist.psu.edu
- Buss, S.R.; Hay, L., On truth-table reducibility to SAT and the difference hierarchy over NP, Proceedings of Third Annual Structure in Complexity Theory Conference: 224–233, 1988, CiteSeerX 10.1.1.5.2387 , ISBN 978-0-8186-0866-7, doi:10.1109/SCT.1988.5282.
web.archive.org
- Mandal, Debasis; Pavan, A.; Venugopalan, Rajeswari. Separating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis. 34th International Conference on Foundation of Software Technology and Theoretical Computer Science. 2014 [2022-08-11]. ISBN 978-3-939897-77-4. （原始内容存档于2022-06-17）.
- 黄文奇; 陈志祥. 递归集的k-1-度上半格的不可补性与不可分配性. 数学学报. 1989-08-29, (04): 517-524 [2022-08-11]. ISSN 0583-1431. （原始内容存档于2022-08-11） （中文（中国大陆））.
worldcat.org
- 黄文奇; 陈志祥. 递归集的k-1-度上半格的不可补性与不可分配性. 数学学报. 1989-08-29, (04): 517-524 [2022-08-11]. ISSN 0583-1431. （原始内容存档于2022-08-11） （中文（中国大陆））.