6 search results - page 1 / 2 » Completely Inapproximable Monotone and Antimonotone Paramete... |
121
click to vote
COCO
2010
Springer
15 years 4 months ago
2010
Springer
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...
COCO
2008
Springer
15 years 2 months ago
2008
Springer
![Approximation of Natural W[P]-Complete Minimisation Problems Is Hard](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Approximation of Natural W[P]-Complete Minimisation Problems Is Hard")
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
104
click to vote
CSL
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
ALDT
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
123
click to vote
BALT
2006
15 years 4 months ago
2006
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...