On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Iyad A. Kanj / rank
Normal rank
 
Property / author
 
Property / author: Iyad A. Kanj / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2017.11.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2767555606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of polynomial-time approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes and parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genus characterizes the complexity of certain graph problems: Some tight results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction obstructions for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the induced matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / 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: Applications of a Planar Separator Theorem / 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: 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: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:17, 14 July 2024

scientific article
Language Label Description Also known as
English
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
scientific article

    Statements

    On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (English)
    0 references
    0 references
    0 references
    0 references
    16 November 2017
    0 references
    weighted satisfiability
    0 references
    parameterized complexity
    0 references
    genus
    0 references

    Identifiers