Open AccessProceedings Article
Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem.
Reads0
Chats0
About:
This article is published in Structure in Complexity Theory Annual Conference.The article was published on 1987-01-01 and is currently open access. It has received 7 citations till now. The article focuses on the topics: Recursively enumerable language & Maximal set.read more
Citations
More filters
Journal ArticleDOI
Honest polynomial time reducibilities and the P=?NP problem☆
TL;DR: It is shown that P = NP implies the existence of a recursively enumerable set A which is minimal for the honest polynomial reducibilities, and shows that P ≠ NP if the degree structures of the honest and nonhonest reducibility on the recursive enumerable sets are isomorphic.
Journal ArticleDOI
Quasi-injective reductions
TL;DR: The connection between degree of injectivity and strength of reduction is studied via two natural families of quasi-injective reductions to completely determine the relative strengths of polynomial-time ƒ(n) -to- reductions, and of polymouth-time k-to- k reductions.
Journal ArticleDOI
The structure of the honest polynomial m-degrees
TL;DR: If P = NP (or a unary alphabet), then if H m or hpm-degrees is honest polynomial, then the topped finite initial segments of H m are exactly the topping of finite distributive lattices, and all recursively presentable distributative lattices are initial segmentsof H m ∩ RE .
Posted Content
Query-Monotonic Turing Reductions
TL;DR: In particular, the authors showed that query-increasing and query-decreasing Turing reductions are incomparable with (that is, are neither strictly stronger than nor strictly weaker than) truth-table reductions and are strictly weaker.