✦ LIBER ✦

Tighter Upper Bounds on the Exact Complexity of String Matching

✍ Scribed by Cole, Richard; Hariharan, Ramesh

Book ID: 118177342
Publisher: Society for Industrial and Applied Mathematics
Year: 1997
Tongue: English
Weight: 751 KB
Volume: 26
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s009753979324694x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Comparison Complexity of the Stri

On the Comparison Complexity of the String Prefix-Matching Problem

✍ Dany Breslauer; Livio Colussi; Laura Toniolo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 525 KB

In this paper we study the exact comparison complexity of the string prefixmatching problem in the deterministic sequential comparison model with equality tests. We derive almost tight lower and upper bounds on the number of symbol comparisons required in the worst case by on-line prefix-matching al

Tighter Bounds on the Size of a MaximumP

Tighter Bounds on the Size of a MaximumP3-Matching in a Cubic Graph

✍ Adrian Kosowski; Michał Małafiejski; Paweł Żyliński 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 265 KB

An exact upper bound to the maximum numb

An exact upper bound to the maximum number of perfect matchings in cubic pseudographs

✍ G. Galbiati 📂 Article 📅 1981 🏛 Springer Milan 🌐 English ⚖ 345 KB

An upper bound on the size of separated

An upper bound on the size of separated matchings

✍ Viola Mészáros 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Exact inequalities for the upper bounds

Exact inequalities for the upper bounds of seminorms on a class of periodic functions

✍ A. A. Ligun 📂 Article 📅 1973 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 207 KB

A new upper bound on the complexity of d

A new upper bound on the complexity of derivative evaluation

✍ H.T. Kung 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 341 KB