Keywords
MathematicsRandomized algorithmCounting problemReduction (mathematics)NP-completeDiscrete mathematicsTime complexityP versus NP problemCryptographyCombinatoricsSubset sum problemAlgorithm
Affiliated Institutions
Related Publications
Solving large knapsack problems with a genetic algorithm
This paper develops a new approach to finding solutions to the subset sum problem. The subset sum problem is an important NP-complete problem in computer science which has appli...
Codes on graphs: normal realizations
A generalized state realization of the Wiberg (1996) type is called normal if symbol variables have degree 1 and state variables have degree 2. A natural graphical model of such...
On the Complexity of Multiple Sequence Alignment
We study the computational complexity of two popular problems in multiple sequence alignment: multiple alignment with SP-score and multiple tree alignment. It is shown that the ...
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are requ...
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such de...
Publication Info
- Year
- 1986
- Type
- article
- Volume
- 47
- Pages
- 85-93
- Citations
- 649
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
649
OpenAlex
339
CrossRef
Cite This
Leslie G. Valiant,
Vijay V. Vazirani
(1986).
NP is as easy as detecting unique solutions.
Theoretical Computer Science
, 47
, 85-93.
https://doi.org/10.1016/0304-3975(86)90135-0
Identifiers
- DOI
- 10.1016/0304-3975(86)90135-0