✦ LIBER ✦

On the polynomial complexity of the equivalence checking problem in algebraic models of programs

✍ Scribed by R. I. Podlovchenko

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On an equivalence checking technique for

✍ R. I. Podlovchenko 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 233 KB

Efficient algorithms for checking the eq

✍ V. L. Shcherbina; V. A. Zakharov 📂 Article 📅 2008 🏛 Allerton Press, Inc. 🌐 English ⚖ 212 KB

On the Parallel Complexity of the Polyno

✍ Peter Bürgisser 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 457 KB

On the Decidability of the Equivalence P

✍ Vladimir A. Zakharov 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 102 KB

Equivalent mathematical programming mode

✍ Ji Soo Kim; Byoung Nam Lee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 563 KB

On the complexity of the instance checki

✍ Andrea Schaerf 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 935 KB