Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi. The relative complexity of NP search problems. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 303-314, ACM, 1995. [doi]
@inproceedings{BeameCEIP95,
title = {The relative complexity of NP search problems},
author = {Paul Beame and Stephen A. Cook and Jeff Edmonds and Russell Impagliazzo and Toniann Pitassi},
year = {1995},
doi = {10.1145/225058.225147},
url = {http://doi.acm.org/10.1145/225058.225147},
tags = {search},
researchr = {https://researchr.org/publication/BeameCEIP95},
cites = {0},
citedby = {0},
pages = {303-314},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA},
publisher = {ACM},
}