CONSTRUCTING ORACLES BY LOWER BOUND TECHNIQUES FOR CIRCUITS

被引：0

|

作者：

KO, KI

机构：

来源：

COMBINATORICS, COMPUTING AND COMPLEXITY | 1989年

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

收藏

页码：30 / 76

页数：47

相关论文

共 50 条

[1] A lower bound method for quantum circuits
Bera, Debajyoti
[J]. INFORMATION PROCESSING LETTERS, 2011, 111 (15) : 723 - 726
[2] A NEW LOWER BOUND FOR PARITY CIRCUITS
DU, DZ
[J]. COMBINATORICS, COMPUTING AND COMPLEXITY, 1989, : 132 - 141
[3] Lower Bound Techniques for QBF Expansion
Beyersdorff, Olaf
Blinkhorn, Joshua
[J]. THEORY OF COMPUTING SYSTEMS, 2020, 64 (03) : 400 - 421
[4] Lower Bound Techniques for QBF Expansion
Olaf Beyersdorff
Joshua Blinkhorn
[J]. Theory of Computing Systems, 2020, 64 : 400 - 421
[5] LOWER BOUND TECHNIQUES FOR VLSI ALGORITHMS
HROMKOVIC, J
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 281 : 2 - 25
[6] NEW LOWER BOUND TECHNIQUES FOR VLSI
LEIGHTON, FT
[J]. MATHEMATICAL SYSTEMS THEORY, 1984, 17 (01): : 47 - 70
[7] A lower bound for the size of syntactically multilinear arithmetic circuits
Raz, Ran
Shpilka, Amir
Yehudayoff, Amir
[J]. 48TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2007, : 438 - +
[8] An exponential lower bound for the size of monotone real circuits
Haken, A
Cook, SA
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 58 (02) : 326 - 335
[9] A LOWER BOUND FOR THE SIZE OF SYNTACTICALLY MULTILINEAR ARITHMETIC CIRCUITS
Raz, Ran
Shpilka, Amir
Yehudayoff, Amir
[J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (04) : 1624 - 1647
[10] An improved approach for constructing lower confidence bound on process yield
Wu, Chien-Wei
Liao, Mou-Yuan
Chen, James C.
[J]. EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2012, 6 (03) : 369 - 390

← 1 2 3 4 5 →