𝔖 Bobbio Scriptorium

✦ LIBER ✦

Lower time bounds for solving linear diophantine equations on several parallel computational models

✍ Scribed by Friedhelm Meyer auf der Heide

Book ID: 114037744
Publisher: Elsevier Science
Year: 1985
Weight: 877 KB
Volume: 67
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(85)80035-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst-Case Complexity Bounds on Algorith

Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations

✍ Iliopoulos, Costas S. 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 772 KB

[IEEE 2008 IEEE International Joint Conf

[IEEE 2008 IEEE International Joint Conference on Neural Networks (IJCNN 2008 - Hong Kong) - Hong Kong, China (2008.06.1-2008.06.8)] 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence) - MATLAB Simulink modeling and simulation of Zhang neural networks for online time-varying sylvester equation solving

✍ Weimu Ma, ; Yunong Zhang, ; Jiahai Wang, 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 192 KB