Succinct monotone circuit certification: planarity and parameterized complexity
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1256750 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- Completely inapproximable monotone and antimonotone parameterized problems
- Contraction obstructions for treewidth
- Graph minors. III. Planar tree-width
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- On the Computational Power of Threshold Circuits with Sparse Activity
- On the complexity of planar Boolean circuits
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
- On the parameterized complexity of multiple-interval graph problems
- Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting
- Quickly excluding a planar graph
- Revisiting the complexity of and/or graph solution
- The complexity of polynomial-time approximation
- Theory and Applications of Satisfiability Testing
- Tractability, hardness, and kernelization lower bound for and/or graph solution
- Upper bounds for monotone planar circuit value and variants
Cited in
(4)
This page was built for publication: Succinct monotone circuit certification: planarity and parameterized complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019496)