Filter Results

Search all journals

Enter search terms…

Advanced search

/

About

About Sage
About Sage Journals
Privacy Policy
Terms of Use
Contact Us
Help

Information for

Authors
Editors
Librarians
Researchers
Reviewers
Frequently asked questions

All content on this site: Copyright © 2026 Sage Publications. All rights reserved. This website is technically supported and operated by China National Publications Import and Export (Group) Co., Ltd. 京ICP备09090397号-11

Search results

Search results page

Articles (2)

Journals (0)

1-2 of 2 results for polynominal-time reducibility

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: Generalized Polynomial-Time Reducibilities,Degrees and NP-Completeness

Restricted access

Research article

First published 1984

Generalized Polynomial-Time Reducibilities,Degrees and NP-Completeness

Uwe Schöning

Fundamenta Informaticae

Select article: Limitations of Efficient Reducibility to the Kolmogorov Random Strings

Free access

Research article

First published February, 2012

Limitations of Efficient Reducibility to the Kolmogorov Random Strings

John M. Hitchcock

Computability

1
10 / page

Filter Results

Article type

Publication date

Subjects

Access