๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of nested-object matching

โœ Scribed by Kumar V. Vadaparty

Publisher
Springer Netherlands
Year
1995
Tongue
English
Weight
639 KB
Volume
14
Category
Article
ISSN
0168-7433

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The complexity of matching with bonds
The complexity of matching with bonds
โœ Manfred Padberg; Antonio Sassano ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 549 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.