3 research outputs found
Regular resolution for CNF of bounded incidence treewidth with few long clauses
We demonstrate that Regular Resolution is FPT for two restricted families of
CNFs of bounded incidence treewidth. The first includes CNFs having at most
clauses whose removal results in a CNF of primal treewidth at most . The
parameters we use in this case are and . The second class includes CNFs
of bounded one-sided (incidence) treewdth, a new parameter generalizing both
primal treewidth and incidence pathwidth. The parameter we use in this case is
the one-sided treewidth
Randomization in Parameterized Complexity (Dagstuhl Seminar 17041)
Dagstuhl Seminar 17041 "Randomization in Parameterized Complexity" took place from January 22nd to January 27th 2017 with the objective to bridge the gap between randomization and parameterized complexity theory. This report documents the talks held during the seminar as well as the open questions arised in the discussion sessions