✦ LIBER ✦

On the completeness and supercompleteness of algorithmic models for comparing text fragments

✍ Scribed by G. V. Nikitov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the solvability and regularity of com

✍ G. V. Nikitov 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 183 KB

On the completeness of an identifiabilit

✍ Yimin Huang; Marco Valtorta 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 703 KB

The Refraction of the Eye, including a C

✍ E., E. 📂 Article 📅 1900 🏛 Nature Publishing Group 🌐 English ⚖ 142 KB

Comparing the predictive value of neural

✍ E. BARTFAY; W.J. MACKILLOP; J.L. PATER 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

Models and algorithms for the optimizati

✍ Ennio Cascetta; Mariano Gallo; Bruno Montella 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 680 KB

Comparative Analysis on Convergence Rate

✍ Lei Xu 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 80 KB