Hard Sets are Hard to Find

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by H. Buhrman Articles by D. Van Melkebeek

13th Annual IEEE Conference on Computational Complexity (CoCo'98)

Buffalo, New York

June 15-June 18

ISBN: 0-8186-8395-3

	ASCII Text	x
	H. Buhrman, D. Van Melkebeek, "Hard Sets are Hard to Find," Computational Complexity, Annual IEEE Conference on, pp. 170, 13th Annual IEEE Conference on Computational Complexity (CoCo'98), 1998.

	BibTex	x
	@article{ 10.1109/CCC.1998.694602, author = {H. Buhrman and D. Van Melkebeek}, title = {Hard Sets are Hard to Find}, journal ={Computational Complexity, Annual IEEE Conference on}, volume = {0}, year = {1998}, issn = {1093-0159}, pages = {170}, doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.1998.694602}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computational Complexity, Annual IEEE Conference on TI - Hard Sets are Hard to Find SN - 1093-0159 SP EP A1 - H. Buhrman, A1 - D. Van Melkebeek, PY - 1998 VL - 0 JA - Computational Complexity, Annual IEEE Conference on ER -

Citation:

H. Buhrman, D. Van Melkebeek, "Hard Sets are Hard to Find," ccc, pp.170, 13th Annual IEEE Conference on Computational Complexity (CoCo'98), 1998

Usage of this product signifies your acceptance of the Terms of Use.