EFFECTIVE LOWER BOUNDS FOR COMPLEXITY OF SOME CLASSES OF SCHEMES

被引：0

作者：

ANDREEV, AE

机构：

来源：

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：24 / 29

页数：6

共 50 条

[1] 2 CLASSES OF PROOFS OF LOWER BOUNDS OF THE COMPLEXITY
NIGMATULLIN, RG
DOKLADY AKADEMII NAUK SSSR, 1987, 294 (02): : 272 - 275
[2] ON LOWER BOUNDS OF THE CLOSENESS BETWEEN COMPLEXITY CLASSES
FU, B
MATHEMATICAL SYSTEMS THEORY, 1993, 26 (02): : 187 - 202
[3] Circuit lower bounds collapse relativized complexity classes
Beigel, R
Maciel, A
FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 222 - 226
[4] Some lower bounds for the complexity of continuation methods
LAO, Université Paul Sabatier, 31062 Toulouse Cedex 04, France
不详
J. Complexity, 4 (454-465):
[5] Some lower bounds for the complexity of continuation methods
Dedieu, JP
Smale, S
JOURNAL OF COMPLEXITY, 1998, 14 (04) : 454 - 465
[6] LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
HONG, J
SCIENTIA SINICA, 1979, 22 (08): : 890 - 900
[7] ON LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
洪加威
Science China Mathematics, 1979, (08) : 890 - 900
[8] NONUNIFORM COMPLEXITY CLASSES SPECIFIED BY LOWER AND UPPER-BOUNDS
BALCAZAR, JL
GABARRO, J
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1989, 23 (02): : 177 - 194
[9] EFFECTIVE LOWER BOUNDS FOR SOME LINEAR FORMS
CUSICK, TW
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 222 (SEP) : 289 - 301
[10] EFFECTIVE LOWER BOUNDS FOR SOME LINEAR FORMS
CUSICK, TW
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 22 (06): : A671 - A671