✦ LIBER ✦

On the Complexity of Some Enumeration Problems for Matroids

✍ Scribed by Khachiyan, L.; Boros, E.; Elbassioni, K.; Gurvich, V.; Makino, K.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Complexity of Matroid Isomorphism

✍ B. V. Raghavendra Rao; M. N. Jayalal Sarma 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 841 KB

On the complexity of some edge-partition

✍ Zbigniew Lonc 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 515 KB

On the complexity of some data analysis

✍ A. V. Kel’manov 📂 Article 📅 2010 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 236 KB

On the complexity of some cluster analys

✍ A. V. Kel’manov 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 290 KB

On the complexity of some coding problem

✍ Ntafos, S.; Hakimi, S. 📂 Article 📅 1981 🏛 IEEE 🌐 English ⚖ 546 KB

The complexity of computing the tutte po

✍ Charles J. Colbourn; J. Scott Provan; Dirk Vertigan 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 478 KB