The Parameterized Complexity of the Unique Coverage Problem (Q5387796): 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-540-77120-3_54
+Normal rank
@@ Property / OpenAlex ID @@
+W1533622011
@@ Property / OpenAlex ID: W1533622011 / rank @@
+Normal rank
@@ Property / cites work @@
+On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
+Normal rank
@@ Property / cites work @@
+Combination can be hard
@@ Property / cites work: Combination can be hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255576
@@ Property / cites work: Q4255576 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank