A Thirty Year Old Conjecture about Promise Problems

Hughes, Andrew; Pavan, A.; Russell, Nathan; Selman, Alan L.

doi:10.1007/978-3-642-31594-7_40

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2015

Publication Types

Select...

Article3

Other1

Relationship

Self Cite1

Independent3

Authors

Journals

Cited by 4 publications

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A thirty Year old conjecture about promise problems

et al. 2015

Self Cite

View full text Add to dashboard Cite

Abstract. Even, Selman, and Yacobi [ESY84,SY82] formulated a conjecture that in current terminology asserts that there do not exist disjoint NP-pairs all of whose separators are NP-hard viaTuring reductions. In this paper we consider a variant of this conjecture-there do not exist disjoint NP-pairs all of whose separators are NP-hard via bounded-truthtable reductions. We provide evidence for this conjecture. We also observe that if the original conjecture holds, then some of the known probabilistic public-key cryptosystems are not NP-hard to crack.

show abstract