167 search results - page 12 / 34 » A class of polynomially solvable linear complementarity prob... |
IJCAI
2003
15 years 1 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
117
click to vote
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
122
click to vote
TCS
2010
14 years 10 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
82
Voted
SIAMMAX
2011
14 years 7 months ago
2011
Rational eigenvalue problems (REPs) are an emerging class of nonlinear eigenvalue problems that arise from a variety of physical applications. In this paper, we propose a lineariz...
115
click to vote
DM
2007
15 years 10 days ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...