✦ LIBER ✦

Computational complexity of sentences over fields

✍ Scribed by Shih Ping Tung

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational Complexity over Finite Fie

✍ Strassen, Volker 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 682 KB

Computational-Complexity of Arithmetical

✍ S.P. Tung 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 868 KB

Sentences over Integral Domains and Thei

✍ Shih Ping Tung 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 290 KB

Computational Complexity over thep-adic

✍ Michael Maller; Jennifer Whitehead 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Polynomial time algorithms for sentences

✍ Shih Ping Tung 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 979 KB

Communication complexity of matrix compu

✍ J. I. Chu; G. Schnitger 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 764 KB