A Comparison of Polynomial Time Reducibilities

&tract. Various forms of polynomial time reducibilig:y zwe compared. Among the forms examined we many-one, bounded truth table, truth 1:able and Turing reducibi!&y. The effect of introducing nondeterminism into red " ,ztiGn procedures is also examined. Computation bounded reducibilities play a role in t theory of' ssralputationa~ complexity which is analogous to, and perhaps as important as, the role sf'the various dls of effective reducibilities used in recursive: function theory. have been the polynomial time bounded reducibilities of Cook respectively cxxresponding to Turing and :m.any-one reducibillities in recursive