@article{Ladner1975103,
    Abstract = {Various forms of polynomial time reducibility are compared. Among the forms examined are many-one, bounded truth table, truth table and Turing reducibility. The effect of introducing nondeterminism into reduction procedures is also examined.},
    Author = {Ladner, R.E. and Lynch, N.A. and Selman, A.L.},
    File = {A comparison of polynomial time reducibilities - Ladner, Lynch, Selman (0) (0) - a - a - d.pdf},
    ISSN = {0304-3975},
    Journal = {Theoretical Computer Science},
    Number = {2},
    Pages = {103 - 123},
    Title = {A comparison of polynomial time reducibilities},
    URL = {http://www.sciencedirect.com/science/article/pii/030439757590016X},
    Volume = {1},
    Year = {1975},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/030439757590016X},
    bdsk-url-2 = {http://dx.doi.org/10.1016/0304-3975(75)90016-X},
    date-added = {2015-02-16 16:03:56 +0000},
    date-modified = {2015-02-16 16:03:56 +0000},
    doi = {10.1016/0304-3975(75)90016-X}
}

@article{Ladner1975103, Abstract = {Various forms of polynomial time reducibility are compared. Among the forms examined are many-one, bounded truth table, truth table and Turing reducibility. The effect of introducing nondeterminism into reduction procedures is also examined.}, Author = {Ladner, R.E. and Lynch, N.A. and Selman, A.L.}, File = {A comparison of polynomial time reducibilities - Ladner, Lynch, Selman (0) (0) - a - a - d.pdf}, ISSN = {0304-3975}, Journal = {Theoretical Computer Science}, Number = {2}, Pages = {103 - 123}, Title = {A comparison of polynomial time reducibilities}, URL = {http://www.sciencedirect.com/science/article/pii/030439757590016X}, Volume = {1}, Year = {1975}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/030439757590016X}, bdsk-url-2 = {http://dx.doi.org/10.1016/0304-3975(75)90016-X}, date-added = {2015-02-16 16:03:56 +0000}, date-modified = {2015-02-16 16:03:56 +0000}, doi = {10.1016/0304-3975(75)90016-X} }