✦ LIBER ✦

A note on the complexity of matching patterns with variables

✍ Scribed by Schmid, Markus L.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on parallel complexity of maximum

✍ 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.

A note on the two-variable pattern-findi

✍ Ker-I Ko; Chin-Ming Hua 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 733 KB

On the complexity of distributed stable

✍ Alex Kipnis; Boaz Patt-Shamir 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 320 KB

[Lecture Notes in Computer Science] Comb

✍ Sahinalp, Suleyman Cenk; Muthukrishnan, S.; Dogrusoz, Ugur 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 260 KB

On the complexity of a family of general

✍ Ten-Hwang Lai; Alan Sprague 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 787 KB

A note on the complexity of program eval

✍ Oscar H. Ibarra; Brian S. Leininger; Louis E. Rosier 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 846 KB