✦ LIBER ✦

Checking chick on cultural complexity: A new finding

✍ Scribed by Munroe, Robert L.

Book ID: 126805224
Publisher: Taylor and Francis Group
Year: 1998
Tongue: English
Weight: 124 KB
Volume: 20
Category: Article
ISSN: 0149-0400
DOI: 10.1080/01490409809512275

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the complexity of finding regu

A note on the complexity of finding regular subgraphs

✍ J. Plesník 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 308 KB

On the Complexity of Finding a Sun in a

On the Complexity of Finding a Sun in a Graph

✍ Hoàng, Chính T. 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 192 KB

On the complexity of finding common appr

On the complexity of finding common approximate substrings

✍ Patricia A. Evans; Andrew D. Smith; H.Todd Wareham 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Problems associated with ÿnding strings that are within a speciÿed Hamming distance of a given set of strings occur in several disciplines. In this paper, we use techniques from parameterized complexity to assess non-polynomial time algorithmic options and complexity for the COMMON APPROXIMATE SUBST

On the query complexity of finding a loc

On the query complexity of finding a local maximum point

✍ A.L. Rastsvetaev; L.D. Beklemishev 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 94 KB

We calculate the minimal number of queries sufficient to find a local maximum point of a function on a discrete interval, for a model with M parallel queries, M 1. Matching upper and lower bounds are obtained. The bounds are formulated in terms of certain Fibonacci type sequences of numbers.

On the Complexity of Finding a Minimum C

On the Complexity of Finding a Minimum Cycle Cover of a Graph

✍ Thomassen, Carsten 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 163 KB

A new check on issuing the licence

✍ Blow, J. Julian; Tada, Shusuke 📂 Article 📅 2000 🏛 Nature Publishing Group 🌐 English ⚖ 154 KB