✦ LIBER ✦

On the complexity of finding the set of candidate keys for a given set of functional dependencies

✍ Scribed by C.T. Yu; D.T. Johnson

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of finding the convex

✍ Davis Avis 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 281 KB

On the relationship of minimum and optim

✍ Heikki Mannila; Kari-Jouko Räihä 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 700 KB

Finding the projection of a given point

✍ A. I. Golikov; Yu. G. Evtushenko 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 530 KB

On the Complexity of Searching a Set of

✍ Hirschberg, D. S. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 408 KB

A note on the complexity of minimum domi

✍ Fabrizio Grandoni 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 92 KB

The smallest one-realization of a given

✍ Ping Zhao; Kefeng Diao; Renying Chang; Kaishun Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 208 KB