A comparison of weak completeness notions

被引：8

作者：

AmbosSpies, K ^{[1
]}

Mayordomo, E ^{[1
]}

Zheng, XZ ^{[1
]}

机构：

[1] UNIV HEIDELBERG,MATH INST,D-69120 HEIDELBERG,GERMANY

来源：

关键词：

D O I：

10.1109/CCC.1996.507679

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：171 / 178

页数：8

共 50 条

[1] Weak Completeness Notions for Exponential Time
Ambos-Spies, Klaus
Bakibayev, Timur
[J]. THEORY OF COMPUTING SYSTEMS, 2019, 63 (06) : 1388 - 1412
[2] Weak Completeness Notions for Exponential Time
Klaus Ambos-Spies
Timur Bakibayev
[J]. Theory of Computing Systems, 2019, 63 : 1388 - 1412
[3] Weak Completeness Notions for Exponential Time
Ambos-Spies, Klaus
Bakibayev, Timur
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2010, 6198 : 503 - 514
[4] A COMPARISON OF POLYNOMIAL-TIME COMPLETENESS NOTIONS
WATANABE, O
[J]. THEORETICAL COMPUTER SCIENCE, 1987, 54 (2-3) : 249 - 265
[5] Comparison of two notions of weak crossed product
Guccione, Jorge A.
Guccione, Juan J.
[J]. JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2021, 20 (04)
[6] Notions of Completeness in the EPR Discussion
Krizek, Gerd Christian
Mairhofer, Lukas
[J]. ENTROPY, 2023, 25 (04)
[7] Husserl's two notions of completeness
Da Silva, JJ
[J]. SYNTHESE, 2000, 125 (03) : 417 - 438
[8] Separation of NP-completeness notions
Pavan, A
Selman, AL
[J]. SIAM JOURNAL ON COMPUTING, 2002, 31 (03) : 906 - 918
[9] Separation of NP-completeness notions
Pavan, A
Selman, AL
[J]. 16TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 78 - 89
[10] 2 NOTIONS OF COMPLETENESS IN SEMIPRIME RINGS
BURGESS, WD
RAPHAEL, R
[J]. COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1976, 283 (13): : 927 - 929