2008
DOI: 10.1093/ietfec/e91-a.1.342
|View full text |Cite
|
Sign up to set email alerts
|

NPMV-Complete Functions That Compute Discrete Logarithms and Integer Factorization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…Note that in [7] they found NPMV-complete functions that directly compute discrete logarithms and integer factorization, where NPMV denotes the class of all partial, multivalued functions computed nondeterministically in polynomial time [15]. Therefore our results should be regarded as a set (or a language) counterpart of the results presented in [7].…”
Section: Introductionmentioning
confidence: 72%
See 2 more Smart Citations
“…Note that in [7] they found NPMV-complete functions that directly compute discrete logarithms and integer factorization, where NPMV denotes the class of all partial, multivalued functions computed nondeterministically in polynomial time [15]. Therefore our results should be regarded as a set (or a language) counterpart of the results presented in [7].…”
Section: Introductionmentioning
confidence: 72%
“…Again, the question is, what is such an NP-complete set? This question was posed in [7], but the answer is not known so far.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation