Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496): 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-030-58150-3_40
+Normal rank
@@ Property / OpenAlex ID @@
+W3081929894
@@ Property / OpenAlex ID: W3081929894 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of polynomial-time approximation
@@ Property / cites work: The complexity of polynomial-time approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Contraction obstructions for treewidth
@@ Property / cites work: Contraction obstructions for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds on the planar branchwidth with respect to the largest grid minor size
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
+Normal rank
@@ Property / cites work @@
+Q4228486
@@ Property / cites work: Q4228486 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bounds for monotone planar circuit value and variants
+Normal rank
@@ Property / cites work @@
+Completely inapproximable monotone and antimonotone parameterized problems
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Tractability, hardness, and kernelization lower bound for and/or graph solution
+Normal rank
@@ Property / cites work @@
+Revisiting the complexity of and/or graph solution
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of planar Boolean circuits
@@ Property / cites work: On the complexity of planar Boolean circuits / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Power of Threshold Circuits with Sparse Activity
+Normal rank