Reduced-illuminance autofluorescence imaging in ABCA4-associated retinal degenerations

Abstract. The notion of p-selective sets, and tally languages, are used to study polynomial time reducibilities on NP. P-selectivity has the property that a set A belongs to the class P if and only if both A < e~A and A is p-selective. We prove that for every tally language set in NP there exists a polynomial time equivalent set in NP that is p-selective. From this result it follows that if NEXT=/= DEXT, then polynomial time Turing and many-one reducibilities differ on NP.

show abstract

Comparison of polynomial-time reducibilities

Ladner¹,

Lynch²,

Selman³

1974

View full text Add to dashboard Cite

Quantitative Relativizations of Complexity Classes

Book¹,

Long²,

Selman³

1984

SIAM J. Comput.

123

View full text Add to dashboard Cite

Complexity Measures For Public-Key Cryptosystems

Grollmann

Selman

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Alan L. Selman

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

Complexity Measures for Public-Key Cryptosystems

A taxonomy of complexity classes of functions

A comparison of polynomial time reducibilities

P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP

Comparison of polynomial-time reducibilities

Quantitative Relativizations of Complexity Classes

Complexity Measures For Public-Key Cryptosystems

Contact Info

Product

Resources

About