Tight Complexity Bounds for Term Matching Problems. Verma, R. M. & Ramakrishnan, I. V. Inf. Comput., 101(1):33-69, November, 1992.
Tight Complexity Bounds for Term Matching Problems [link]Link  Tight Complexity Bounds for Term Matching Problems [link]Paper  bibtex   
@article{journals/iandc/VermaR92,
  added-at = {2018-11-02T00:00:00.000+0100},
  author = {Verma, Rakesh M. and Ramakrishnan, I. V.},
  biburl = {https://www.bibsonomy.org/bibtex/2b13c53f13ed87b67fe977e77dab49659/dblp},
  ee = {https://doi.org/10.1016/0890-5401(92)90075-Q},
  interhash = {ed3082c02d3c49fb1937fb7125b07513},
  intrahash = {b13c53f13ed87b67fe977e77dab49659},
  journal = {Inf. Comput.},
  keywords = {dblp},
  month = {November},
  number = 1,
  pages = {33-69},
  timestamp = {2018-11-03T12:02:36.000+0100},
  title = {Tight Complexity Bounds for Term Matching Problems},
  url = {http://dblp.uni-trier.de/db/journals/iandc/iandc101.html#VermaR92},
  volume = 101,
  year = 1992
}

Downloads: 0