L. M.Adleman, K. Manders. Reducibility, randomness, and intractability, ACM Symposium on Theory of Computing, 1977, pp. 151--163. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dot Operators - Borchert, Silvestri (Correct)
.... [16] xiii) T (nondeterministic Turing [16] xiv) T (PSPACE Turing [22] b) The following reducibilities can be represented by promise dot operators but not by complementary dot operators: bounded truth table [16] strong nondeterministic Turing [17] random many one [1, 29]) BPP many one [1, 29] c) The following reducibilities can be represented by promise dot operators (but the authors do not know whether they can be represented by complementary dot operators) ptt (positive truth table [16] rptt (locally right positive truth table [9] lptt (locally ....
.... Turing [16] xiv) T (PSPACE Turing [22] b) The following reducibilities can be represented by promise dot operators but not by complementary dot operators: bounded truth table [16] strong nondeterministic Turing [17] random many one [1, 29] BPP many one [1, 29]) c) The following reducibilities can be represented by promise dot operators (but the authors do not know whether they can be represented by complementary dot operators) ptt (positive truth table [16] rptt (locally right positive truth table [9] lptt (locally left positive truth table ....
[Article contains additional citation context not shown here]
L. M.Adleman, K. Manders. Reducibility, randomness, and intractability, ACM Symposium on Theory of Computing, 1977, pp. 151--163.
Dot Operators - Borchert, Silvestri (Correct)
.... Turing [16] xiv) PS T (PSPACE Turing [22] b) The following reducibilities can be represented by promise dot operators but not by complementary dot operators: i) p btt (bounded truth table [16] ii) SN T (strong nondeterministic Turing [17] iii) RP m (random many one [1, 29]) iv) BPP m (BPP many one [1, 29] c) The following reducibilities can be represented by promise dot operators (but the authors do not know whether they can be represented by complementary dot operators) i) p ptt (positive truth table [16] ii) p rptt (locally right positive ....
.... Turing [22] b) The following reducibilities can be represented by promise dot operators but not by complementary dot operators: i) p btt (bounded truth table [16] ii) SN T (strong nondeterministic Turing [17] iii) RP m (random many one [1, 29] iv) BPP m (BPP many one [1, 29]) c) The following reducibilities can be represented by promise dot operators (but the authors do not know whether they can be represented by complementary dot operators) i) p ptt (positive truth table [16] ii) p rptt (locally right positive truth table [9] iii) p lptt (locally left ....
[Article contains additional citation context not shown here]
L. M.Adleman, K. Manders. Reducibility, randomness, and intractability, ACM Symposium on Theory of Computing, 1977, pp. 151--163.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC