On intractability of the classUP (Q3201755): Difference between revisions

@@ Property / cites work @@
+Tally languages and complexity classes
@@ Property / cites work: Tally languages and complexity classes / 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 sparse sets in NP-P
@@ Property / cites work: On sparse sets in NP-P / rank @@
+Normal rank
@@ Property / cites work @@
+Q3802608
@@ Property / cites work: Q3802608 / rank @@
+Normal rank
@@ Property / cites work @@
+On some natural complete operators
@@ Property / cites work: On some natural complete operators / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
+Normal rank
@@ Property / cites work @@
+The density and complexity of polynomial cores for intractable sets
+Normal rank
@@ Property / cites work @@
+Complete sets and closeness to complexity classes
@@ Property / cites work: Complete sets and closeness to complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+Relative complexity of checking and evaluating
@@ Property / cites work: Relative complexity of checking and evaluating / rank @@
+Normal rank
@@ Property / cites work @@
+On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
+Normal rank