𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm to computeω-primality in a numerical monoid

✍ Scribed by David F. Anderson; Scott T. Chapman; Nathan Kaplan; Desmond Torkornoo

Book ID
105928102
Publisher
Springer
Year
2010
Tongue
English
Weight
388 KB
Volume
82
Category
Article
ISSN
0037-1912

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of Computer Computations || A
Complexity of Computer Computations || An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File
✍ Miller, Raymond E.; Thatcher, James W.; Bohlinger, Jean D. 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 789 KB

The Symposium On The Complexity Of Computer Compu Tations Was Held At The Ibm Thomas J. Watson Research Center In Yorktown Heights, New York, March 20-22, 1972. These Proceedings Contain All Papers Presented At The Symposium Together With A Transcript Of The Concluding Panel Discussion And A Compreh