Algebraic methods in the global theory o
✍ Banica C., Stanasila O.
📂 Library
📅 1976
🏛 Wiley
🌐 English
✍ Scribed by Constantin Bănică, Octavian Stănăşilă
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
<p>One of the most important and successful theories in computational complex ity is that of NP-completeness. This discrete theory is based on the Turing machine model and achieves a classification of discrete computational prob lems according to their algorithmic difficulty. Turing machines forma