Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of polynomial-time approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction obstructions for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on the planar branchwidth with respect to the largest grid minor size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for monotone planar circuit value and variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely inapproximable monotone and antimonotone parameterized problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability, hardness, and kernelization lower bound for and/or graph solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting the complexity of and/or graph solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of planar Boolean circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Power of Threshold Circuits with Sparse Activity / rank
 
Normal rank

Latest revision as of 01:00, 25 July 2024

scientific article
Language Label Description Also known as
English
Succinct monotone circuit certification: planarity and parameterized complexity
scientific article

    Statements

    Succinct monotone circuit certification: planarity and parameterized complexity (English)
    0 references
    21 April 2021
    0 references
    monotone circuits
    0 references
    planarity
    0 references
    genus
    0 references
    FPT
    0 references
    treewidth
    0 references

    Identifiers