Inproceedings,
The relative complexity of NP search problems.
P. Beame, S. Cook, J. Edmonds, R. Impagliazzo, and T. Pitassi.STOC, page 303-314. ACM, (1995)
Meta data
- BibTeX key
- conf/stoc/BeameCEIP95
- entry type
- inproceedings
- booktitle
- STOC
- year
- 1995
- pages
- 303-314
- publisher
- ACM
- crossref
- conf/stoc/STOC27
- ee
- https://doi.org/10.1145/225058.225147
- isbn
- 0-89791-718-9
- url
- http://dblp.uni-trier.de/db/conf/stoc/stoc1995.html#BeameCEIP95
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Conference Paper
%1 conf/stoc/BeameCEIP95
%A Beame, Paul
%A Cook, Stephen A.
%A Edmonds, Jeff
%A Impagliazzo, Russell
%A Pitassi, Toniann
%B STOC
%D 1995
%E Leighton, Frank Thomson
%E Borodin, Allan
%I ACM
%K dblp
%P 303-314
%T The relative complexity of NP search problems.
%U http://dblp.uni-trier.de/db/conf/stoc/stoc1995.html#BeameCEIP95
%@ 0-89791-718-9
@inproceedings{conf/stoc/BeameCEIP95,
added-at = {2023-09-30T00:00:00.000+0200},
author = {Beame, Paul and Cook, Stephen A. and Edmonds, Jeff and Impagliazzo, Russell and Pitassi, Toniann},
biburl = {https://www.bibsonomy.org/bibtex/2966efdb9b8046d877a687903d04a5971/dblp},
booktitle = {STOC},
crossref = {conf/stoc/STOC27},
editor = {Leighton, Frank Thomson and Borodin, Allan},
ee = {https://doi.org/10.1145/225058.225147},
interhash = {23b11055c3a88778573cde2763f318c2},
intrahash = {966efdb9b8046d877a687903d04a5971},
isbn = {0-89791-718-9},
keywords = {dblp},
pages = {303-314},
publisher = {ACM},
timestamp = {2024-04-10T05:34:20.000+0200},
title = {The relative complexity of NP search problems.},
url = {http://dblp.uni-trier.de/db/conf/stoc/stoc1995.html#BeameCEIP95},
year = 1995
}