260 search results - page 26 / 52 » Hardness of Parameterized Resolution |
SAT
2004
Springer
14 years 1 months ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
IEEEHPCS
2010
13 years 6 months ago
2010
In the past few years, research in the domain of networkon-chip has been concentrated on application-specific approaches. These approaches are design-time parameterized approache...
IWPEC
2010
Springer
13 years 5 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
VIIP
2001
13 years 9 months ago
2001
This project addresses the issue of developing interactive rendering methods for datasets which cannot be stored on a single hard drive or in main memory anymore. Our dataset is a...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...