Book ChapterDOI
The Complexity of Promise Problems
Alan L. Selman,Yacov Yacobi +1 more
- pp 502-509
Reads0
Chats0
TLDR
A “promise problem” is a formulation of a partial decision problem that arises from Even and Yacobi's work in public-key cryptography.Abstract:
A “promise problem” is a formulation of a partial decision problem. Complexity issues about promise problems arise from Even and Yacobi's work in public-key cryptographyread more
Citations
More filters
Journal ArticleDOI
Promise problems complete for complexity classes
TL;DR: NP-hardness of the satisfiability promise problem follows, and graph isomorphism hardness of a promise problem that derives from the graph isomorphicism problem is proved.
Journal ArticleDOI
A thirty Year old conjecture about promise problems
TL;DR: This paper considers a variant of this conjecture—there do not exist disjoint NP-pairs all of whose separators are NP-hard via bounded-truth-table reductions and observes that if the original conjecture holds, then some of the known probabilistic public-key cryptosystems are not NP- hard to crack.
Book ChapterDOI
A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman
TL;DR: A recursion-theoretic result telling when a family of reductions to a class can be replaced by a single oracle Turing machine is derived.
DissertationDOI
Randomness in completeness and space-bounded computations
TL;DR: In this paper, the authors present a survey of the state of the art in the field of artificial intelligence and artificial intelligence, focusing on the following issues: 1) this paper.
Book ChapterDOI
A thirty year old conjecture about promise problems
TL;DR: If the original conjecture holds, then some of the known probabilistic public-key cryptosystems are not NP-hard to crack.
References
More filters
Journal ArticleDOI
On the Structure of Polynomial Time Reducibility
TL;DR: The method of showing density ymlds the result that if P ~ NP then there are members of NP -P that are not polynomml complete is shown, which means there is a strictly ascending sequence with a minimal pair of upper bounds to the sequence.
Book ChapterDOI
Cryptocomplexity and NP-Completeness
Shimon Even,Yacov Yacobi +1 more
TL;DR: Two cryptosystems based on the knapsack problem are displayed, one of which has been shown by Lempel to be almost always easy to crack and shows that NP-hardness of a cryptos system is not enough.
Journal ArticleDOI
Partial algorithm problems for context free languages
TL;DR: There is no partial algorithm for identifying, given grammars G1 and G2, a sequential machine, if one exists, mapping L(G1) to L (G2), and there are several observations on the relationship between partial algorithm and associated decision problems.