On the Complexity of the Minimum Independent Set Partition Problem (Q3196378): Difference between revisions

@@ 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.1007/978-3-319-21398-9_10
+Normal rank
@@ Property / OpenAlex ID @@
+W1160767717
@@ Property / OpenAlex ID: W1160767717 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
+Normal rank
@@ Property / cites work @@
+Zero knowledge and the chromatic number
@@ Property / cites work: Zero knowledge and the chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+Q4077442
@@ Property / cites work: Q4077442 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Vector Partition Problem for Convex Objective Functions
+Normal rank
@@ Property / cites work @@
+k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
@@ Property / cites work: k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3196378