✦ LIBER ✦

Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems

✍ Scribed by Derek E. Armstrong; Sheldon H. Jacobson

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of test case generatio

✍ Laura A. Sanchis 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 562 KB

On the performance guarantee of neural n

✍ V. Zissimopoulos 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 596 KB

Conditions for the coincidence of local

✍ T. T. Lebedeva; I. V. Sergienko; V. P. Soltan 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 910 KB

A machine learning approach to algorithm

✍ Haipeng Guo; William H. Hsu 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 571 KB

An approach to estimating the complexity

✍ V. A. Mikhailyuk 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 99 KB

The pareto-optimal set of the NP-hard pr

✍ A. A. Lazarev 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 205 KB