Provider: Schloss Dagstuhl - Leibniz Center for Informatics
Database: dblp computer science bibliography
Content:text/plain; charset="utf-8"
TY - CPAPER
ID - DBLP:conf/stoc/Long79
AU - Long, Timothy J.
TI - On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract)
BT - Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA
SP - 278
EP - 287
PY - 1979//
DO - 10.1145/800135.804421
UR - https://doi.org/10.1145/800135.804421
ER -