The complexity of promise problems with applications to public-key cryptography

Shimon Even, A. L. S., & Yacobi, Y. (1984). The complexity of promise problems with applications to public-key cryptography.

Type

Unclassified

Intellectual base

Unclassified

Year

1984

DOI

10.1016/s0019-9958(84)80056-x

Link

https://doi.org/10.1016/s0019-9958(84)80056-x

Cited by

1 citation across 1 artifact.

Domain-specific

• Computational problem
  • A computational problem assigns each valid finite input representation a set of permitted outputs, with decision, search, counting, function, optimization, and promise forms distinguished by output and domain structure.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:ae5705ccb9dd · see in the full table