• DocumentCode
    2362762
  • Title

    Optimizing TRIEs for ordered pattern matching is Π2 P-complete

  • Author

    Lin, Chih-Long

  • Author_Institution
    Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA
  • fYear
    1995
  • fDate
    19-22 Jun 1995
  • Firstpage
    238
  • Lastpage
    244
  • Abstract
    We consider the complexity of constructing a data structure, called TRIEs, with the minimum operational cost for the ordered pattern matching problem, a problem abstracting the essence of executing Prolog problems; a TRIE with minimal cost corresponds to a program with the minimum worst case operational cost. Based on the recent non-approximability results developed by Arora et al. (1992) and Condon et al. (1993), we show that to approximate the optimum cost of this problem to within some constant ratio is Π2P-hard. The result implies that the problem of Prolog program optimization is probably as hard
  • Keywords
    PROLOG; computational complexity; optimisation; tree data structures; Prolog problems; Prolog program optimization; complexity; data structure; minimum operational cost; optimizing TRIEs; ordered pattern matching; Computational complexity; Computer science; Cost function; Data structures; Electronic mail; Pattern matching; Tail; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1995., Proceedings of Tenth Annual IEEE
  • Conference_Location
    Minneapolis, MN
  • ISSN
    1063-6870
  • Print_ISBN
    0-8186-7052-5
  • Type

    conf

  • DOI
    10.1109/SCT.1995.514862
  • Filename
    514862
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2362762