1554 search results - page 24 / 311 » Parameterized Complexity and Approximation Algorithms |
SIAMCOMP
2008
14 years 10 months ago
2008
![Resolution Is Not Automatizable Unless W[P] Is Tractable](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Resolution Is Not Automatizable Unless W[P] Is Tractable")
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
ICCAD
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper we propose a novel parameterized interconnect order reduction algorithm, CORE, to efficiently capture both inter-die and intra-die variations. CORE applies a two-ste...
110
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
106
click to vote
ALGORITHMICA
2008
14 years 10 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
ISAAC
2003
Springer
15 years 3 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...