Exact calculations for the repeated many-one test

被引：0

作者：

Wang, Qin ^{[1
]}

机构：

[1] Univ of Cincinnati Medical Cent, Cincinnati, United States

来源：

Computational Statistics and Data Analysis | 1998年 / 27卷 / 04期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：389 / 399

共 50 条

[41] R1-ttSN(NP) distinguishes robust many-one and turing completeness
Hemaspaandra, E
Hemaspaandra, LA
Hempel, H
THEORY OF COMPUTING SYSTEMS, 1998, 31 (03) : 307 - 325
[42] RSN1-tt (NP) distinguishes robust many-one and Turing completeness
Hemaspaandra, E
Hemaspaandra, LA
Hempel, H
ALGORITHMS AND COMPLEXITY, 1997, 1203 : 49 - 60
[43] FISHER EXACT PROBABILITY TEST - THE CALCULATIONS
BOOTH, IJM
BOOTH, AD
MATHEMATICAL GAZETTE, 1983, 67 (440): : 131 - 133
[44] RSN1-tt (NP) distinguishes robust many-one and turing completeness
Hemaspaandra, E.
Hemaspaandra, L.A.
Hempel, H.
Theory of Computing Systems, 31 (03): : 307 - 325
[45] RSN1-tt(NP) Distinguishes Robust Many-One and Turing Completeness
E. Hemaspaandra
L. A. Hemaspaandra
H. Hempel
Theory of Computing Systems, 1998, 31 : 307 - 325
[46] CONSTRUCTIVE MANY-ONE REDUCTION FROM THE HALTING PROBLEM TO SEMI-UNIFICATION (EXTENDED VERSION)
Dudenhefner, Andrej
LOGICAL METHODS IN COMPUTER SCIENCE, 2023, 19 (04) : 1 - 22
[47] Many visions, many aims, one test
Bracey, GW
PHI DELTA KAPPAN, 1997, 78 (05) : 411 - 412
[48] REPRESENTATION OF MANY-ONE DEGREES BY TAG SYSTEMS WITH FIXED DELETION NUMBER - PRELIMINARY-REPORT
FALKENBERG, B
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 23 (05): : A496 - A496
[49] NEW GENERAL-APPROACH TO THE THEORY OF THE MANY-ONE EQUIVALENCE OF DECISION PROBLEMS FOR ALGORITHMIC SYSTEMS
BORGER, E
ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1979, 25 (02): : 135 - 162
[50] Sample size determination for multiple many-one and pairwise comparisons of proportions using the arcsin transformation
Vollandt, R
Horn, M
COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2001, 30 (12) : 2481 - 2498

← 1 2 3 4 5 →