✦ LIBER ✦

On the complexity of a family of generalized matching problems

✍ Scribed by Ten-Hwang Lai; Alan Sprague

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 787 KB
Volume: 12
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(85)90032-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Counting Problems in E

The Complexity of Counting Problems in Equational Matching

✍ Miki Hermann; Phokion G. Kolaitis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 805 KB

On the complexity of generalized due dat

On the complexity of generalized due date scheduling problems

✍ Nicholas G. Hall; Suresh P. Sethi; Chelliah Sriskandarajah 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 700 KB

On the complexity of nested-object match

On the complexity of nested-object matching

✍ Kumar V. Vadaparty 📂 Article 📅 1995 🏛 Springer Netherlands 🌐 English ⚖ 639 KB

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

A note on parallel complexity of maximum

A note on parallel complexity of maximum f-matching

✍ Anders Dessmark; Oscar Garrido; Andrzej Lingas 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 306 KB

We present a randomized NC solution to the problem of constructing a maximum (cardinality) f-matching. constraints. @ 1998 Elsevier Science B.V.

On the complexity of recognizing a class

On the complexity of recognizing a class of generalized networks

✍ Vijaya Chandru; Collette R Coullard; Donald K Wagner 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 298 KB