A WORST-CASE OF CIRCULARITY TEST ALGORITHMS FOR ATTRIBUTE GRAMMARS

被引：0
|
作者：
WU, PC
WANG, FJ
机构：
来源：
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 1995年 / 17卷 / 02期
关键词：
ALGORITHMS; LANGUAGES; THEORY; ATTRIBUTE GRAMMARS; CIRCULARITY TEST; DEPENDENCY GRAPHS;
D O I：
10.1145/201059.201064
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Although the circularity test problem for attribute grammars (AGs) has been proven to be intrinsically exponential, to date, a worst case for the existing circularity test algorithms has yet to be presented. This note presents a worst-case AG in which the number of incomparable dependency graphs induced at the root is exponential. The worst case can help to clarify the complexity of the problem.
引用
收藏
页码：228 / 232
页数：5
相关论文
共 50 条
  • [21] WORST-CASE AND PROBABILISTIC ANALYSIS OF ALGORITHMS FOR A LOCATION PROBLEM
    CORNUEJOLS, G
    NEMHAUSER, GL
    WOLSEY, LA
    OPERATIONS RESEARCH, 1980, 28 (04) : 847 - 858
  • [22] Minimum and Worst-Case Performance Ratios of Rollout Algorithms
    Bertazzi, Luca
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2012, 152 (02) : 378 - 393
  • [23] Algorithms for worst-case design and applications to risk management
    Pardalos, PM
    JOURNAL OF ECONOMICS-ZEITSCHRIFT FUR NATIONALOKONOMIE, 2003, 80 (02): : 197 - 198
  • [24] Local search algorithms for SAT: Worst-case analysis
    Hirsch, EA
    ALGORITHM THEORY - SWAT'98, 1998, 1432 : 246 - 254
  • [25] SAT local search algorithms: Worst-case study
    Hirsch, EA
    JOURNAL OF AUTOMATED REASONING, 2000, 24 (1-2) : 127 - 143
  • [26] Conditional central algorithms for worst-case estimation and filtering
    Garulli, A
    Vicino, A
    Zappa, G
    PROCEEDINGS OF THE 36TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-5, 1997, : 2453 - 2458
  • [27] INTRINSICALLY EXPONENTIAL COMPLEXITY OF CIRCULARITY PROBLEM FOR ATTRIBUTE GRAMMARS
    JAZAYERI, M
    OGDEN, WF
    ROUNDS, WC
    COMMUNICATIONS OF THE ACM, 1975, 18 (12) : 697 - 706
  • [28] Worst-Case Execution Time Test Generation for Augmenting Path Maximum Flow Algorithms using Genetic Algorithms
    Arkhipov, Viktor
    Buzdalov, Maxim
    Shalyto, Anatoly
    2013 12TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA 2013), VOL 2, 2013, : 108 - 111
  • [29] Identifying unpredictable test examples with worst-case guarantees
    Goldwasser, Shafi
    Kalai, Adam Tauman
    Kalai, Yael Tauman
    Montasser, Omar
    2020 INFORMATION THEORY AND APPLICATIONS WORKSHOP (ITA), 2020,
  • [30] Worst-Case Test Conditions of SEGR for Power DMOSFETs
    Liu, Sandra
    Titus, Jeffrey L.
    Zafrani, Max
    Cao, Huy
    Carrier, Douglas
    Sherman, Phillip
    IEEE TRANSACTIONS ON NUCLEAR SCIENCE, 2010, 57 (01) : 279 - 287
12345