✦ LIBER ✦

On the complexity of two circle strongly connecting problems

✍ Scribed by Nen-Fu Huang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of two circle connecti

✍ Nen-Fu Huang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 910 KB

On two problems of turing complexity for

✍ S. S. Goncharov 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 180 KB

On some problems connected with polynomi

✍ J. Szabados 📂 Article 📅 1979 🏛 Akadmiai Kiad 🌐 English ⚖ 550 KB

The complexity of domination problems in

✍ J.Mark Keil 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 854 KB

The strongly connecting problem on multi

✍ Chen, W.-T.; Huang, N.-F. 📂 Article 📅 1989 🏛 IEEE 🌐 English ⚖ 384 KB

On Two Extremum Problems for Polynomials

✍ Mulholland, H. P. 📂 Article 📅 1956 🏛 Oxford University Press 🌐 English ⚖ 263 KB