Algebraic Methods in the Global Theory o
β Constantin BΔnicΔ, Octavian StΔnΔΕilΔ
π Library
π
1976
π John Wiley & Sons Ltd
π English
β Scribed by Banica C., Stanasila O.
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