✦ LIBER ✦

Computing the Additive Complexity of Algebraic Circuits with Root Extracting

✍ Scribed by Grigoriev, Dima; Karpinski, Marek

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computability of the additive complexity

✍ Dima Grigoriev; Marek Karpinski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 643 KB

Modelling the complexity of parallel and

✍ Constantinos V. Papadopoulos; Theodoros S. Andronikos 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 706 KB

On the Complexity of Isolating Real Root

✍ B. Mourrain; M.N. Vrahatis; J.C. Yakoubsohn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Lower bounds for the non-linear complexi

✍ Michael D. Hirsch 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 687 KB

Amination with Pd–NHC Complexes: Rate an

✍ Ka Hou Hoi; Dr. Selçuk Çalimsiz; Dr. Robert D. J. Froese; Prof. Alan C. Hopkinso 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

A modified program for computation of fo

✍ Qingyan Cai; Yan Peng; Lihua Nie; Shouzho Yao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 406 KB