%0 Journal Article %1 journals/iandc/VermaR92 %A Verma, Rakesh M. %A Ramakrishnan, I. V. %D 1992 %J Inf. Comput. %K dblp %N 1 %P 33-69 %T Tight Complexity Bounds for Term Matching Problems %U http://dblp.uni-trier.de/db/journals/iandc/iandc101.html#VermaR92 %V 101

@article{journals/iandc/VermaR92, added-at = {2021-02-12T00: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 = {2024-04-09T06:10:29.000+0200}, title = {Tight Complexity Bounds for Term Matching Problems}, url = {http://dblp.uni-trier.de/db/journals/iandc/iandc101.html#VermaR92}, volume = 101, year = 1992 }