The complexity of unions of disjoint sets (Q955349): Difference between revisions

@@ Property / author @@
+Selman, Alan L.
@@ Property / author: Selman, Alan L. / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2008.05.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2073363580
@@ Property / OpenAlex ID: W2073363580 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3337457
@@ Property / cites work: Q3337457 / rank @@
+Normal rank
@@ Property / cites work @@
+On the unique satisfiability problem
@@ Property / cites work: On the unique satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+On Isomorphisms and Density of $NP$ and Other Complete Sets
+Normal rank
@@ Property / cites work @@
+Splittings, Robustness, and Structure of Complete Sets
+Normal rank
@@ Property / cites work @@
+Q5501847
@@ Property / cites work: Q5501847 / rank @@
+Normal rank
@@ Property / cites work @@
+Inclusion complete tally languages and the Hartmanis-Berman conjecture
+Normal rank
@@ Property / cites work @@
+The Boolean Hierarchy I: Structural Properties
@@ Property / cites work: The Boolean Hierarchy I: Structural Properties / rank @@
+Normal rank
@@ Property / cites work @@
+Uniformly hard languages.
@@ Property / cites work: Uniformly hard languages. / rank @@
+Normal rank
@@ Property / cites work @@
+Separability and one-way functions
@@ Property / cites work: Separability and one-way functions / rank @@
+Normal rank
@@ Property / cites work @@
+Redundancy in Complete Sets
@@ Property / cites work: Redundancy in Complete Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Measures for Public-Key Cryptosystems
@@ Property / cites work: Complexity Measures for Public-Key Cryptosystems / rank @@
+Normal rank
@@ Property / cites work @@
+Machines that Can Output Empty Words
@@ Property / cites work: Machines that Can Output Empty Words / rank @@
+Normal rank
@@ Property / cites work @@
+Q3764142
@@ Property / cites work: Q3764142 / rank @@
+Normal rank
@@ Property / cites work @@
+Comparing Reductions to NP-Complete Sets
@@ Property / cites work: Comparing Reductions to NP-Complete Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3129783
@@ Property / cites work: Q3129783 / rank @@
+Normal rank
@@ Property / cites work @@
+The difference and truth-table hierarchies for NP
@@ Property / cites work: The difference and truth-table hierarchies for NP / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of polynomial time reducibilities
@@ Property / cites work: A comparison of polynomial time reducibilities / rank @@
+Normal rank
@@ Property / cites work @@
+On the Shannon capacity of a graph
@@ Property / cites work: On the Shannon capacity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A low and a high hierarchy within NP
@@ Property / cites work: A low and a high hierarchy within NP / rank @@
+Normal rank
@@ Property / cites work @@
+P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
+Normal rank
@@ Property / cites work @@
+Natural Self-Reducible Sets
@@ Property / cites work: Natural Self-Reducible Sets / 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 @@
+Q3703297
@@ Property / cites work: Q3703297 / rank @@
+Normal rank