Reductions among polynomial isomorphism types (Q1077412): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(85)90139-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2051433988
@@ Property / OpenAlex ID: W2051433988 / rank @@
+Normal rank
@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+Q4160434
@@ Property / cites work: Q4160434 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on Sparse Complete Sets
@@ Property / cites work: A Note on Sparse Complete Sets / rank @@
+Normal rank
@@ Property / cites work @@
+On log-tape isomorphisms of complete sets
@@ Property / cites work: On log-tape isomorphisms of complete sets / rank @@
+Normal rank
@@ Property / cites work @@
+A note on natural complete sets and Goedel numberings
+Normal rank
@@ Property / cites work @@
+On Simple Goedel Numberings and Translations
@@ Property / cites work: On Simple Goedel Numberings and Translations / rank @@
+Normal rank
@@ Property / cites work @@
+Oracle-dependent properties of the lattice of NP sets
+Normal rank
@@ Property / cites work @@
+Some remarks on witness functions for nonpolynomial and noncomplete sets in NP
+Normal rank
@@ Property / cites work @@
+Completeness, Approximation and Density
@@ Property / cites work: Completeness, Approximation and Density / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse Sets in : Relativizations
@@ Property / cites work: Sparse Sets in : Relativizations / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+The honest subrecursive classes are a lattice
@@ Property / cites work: The honest subrecursive classes are a lattice / rank @@
+Normal rank
@@ Property / cites work @@
+On the density of honest subrecursive classes
@@ Property / cites work: On the density of honest subrecursive classes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4153600
@@ Property / cites work: Q4153600 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
+Normal rank
@@ Property / cites work @@
+Recursively enumerable sets of positive integers and their decision problems
+Normal rank
@@ Property / cites work @@
+Q5573961
@@ Property / cites work: Q5573961 / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of Unsolvability. (AM-55)
@@ Property / cites work: Degrees of Unsolvability. (AM-55) / rank @@
+Normal rank
@@ Property / cites work @@
+Linear orderings under one-one reducibility
@@ Property / cites work: Linear orderings under one-one reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+A note on dense and nondense families of complexity classes
+Normal rank
@@ Property / cites work @@
+Cook reducibility is faster than Karp reducibility in NP
+Normal rank