1383 search results - page 125 / 277 » On the Complexity of the Interlace Polynomial |
172
click to vote
MP
2007
15 years 6 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
150
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
160
click to vote
COCOA
2007
Springer
16 years 18 days ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
169
click to vote
CONCUR
2007
Springer
16 years 18 days ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
175
click to vote
ISSAC
2007
Springer
16 years 17 days ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...