LOWER BOUND TECHNIQUES FOR VLSI ALGORITHMS

被引：0
|
作者：
HROMKOVIC, J
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1987年 / 281卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：2 / 25
页数：24
相关论文
共 50 条
  • [1] NEW LOWER BOUND TECHNIQUES FOR VLSI
    LEIGHTON, FT
    [J]. MATHEMATICAL SYSTEMS THEORY, 1984, 17 (01): : 47 - 70
  • [2] A LOWER BOUND FOR PROBABILISTIC DISTRIBUTED ALGORITHMS
    PACHL, JK
    [J]. JOURNAL OF ALGORITHMS, 1987, 8 (01) : 53 - 65
  • [3] PARALLELISM DETECTION AND TRANSFORMATION TECHNIQUES USEFUL FOR VLSI ALGORITHMS
    FORTES, JAB
    MOLDOVAN, DI
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1985, 2 (03) : 277 - 301
  • [4] Lower Bound Techniques for QBF Expansion
    Beyersdorff, Olaf
    Blinkhorn, Joshua
    [J]. THEORY OF COMPUTING SYSTEMS, 2020, 64 (03) : 400 - 421
  • [5] Lower Bound Techniques for QBF Expansion
    Olaf Beyersdorff
    Joshua Blinkhorn
    [J]. Theory of Computing Systems, 2020, 64 : 400 - 421
  • [6] A detailed comparative analysis of μ lower bound algorithms
    Fabrizi, Andrea
    Roos, Clement
    Biannic, Jean-Marc
    [J]. 2014 EUROPEAN CONTROL CONFERENCE (ECC), 2014, : 220 - 226
  • [7] Function matching: Algorithms, applications, and a lower bound
    Amir, A
    Aumann, Y
    Cole, R
    Lewenstein, M
    Porat, E
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2003, 2719 : 929 - 942
  • [8] CONSTRUCTING ORACLES BY LOWER BOUND TECHNIQUES FOR CIRCUITS
    KO, KI
    [J]. COMBINATORICS, COMPUTING AND COMPLEXITY, 1989, : 30 - 76
  • [9] Kernelization: New Upper and Lower Bound Techniques
    Bodlaender, Hans L.
    [J]. PARAMETERIZED AND EXACT COMPUTATION, 2009, 5917 : 17 - 37
  • [10] Lower Bound Techniques for QBF Proof Systems
    Mahajan, Meena
    [J]. 35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
12345