Nondeterminism and NP-Completeness
Several different additions to the basic deterministic Turing-machine model are often considered. These additions add computational power to the model and so allow us to compute certain problems more efficiently. Often these are important problems with seemingly no efficient solution in the basic model. The question then becomes whether the efficiency the additional power provides is really due to the new model or whether the added efficiency could have been attained without the additional resources.
KeywordsPolynomial Time Turing Machine Vertex Cover Conjunctive Normal Form Propositional Formula
Unable to display preview. Download preview PDF.