1998 search results - page 158 / 400 » Complexity of the Cover Polynomial |
189
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
278
click to vote
CSMR
2000
IEEE
15 years 11 months ago
2000
IEEE
While Software Engineering has mainly focused so far on software development, software deployment is now emerging as a new research field. Software or Application deployment is a ...
171
click to vote
ICIP
2005
IEEE
16 years 8 months ago
2005
IEEE
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
147
click to vote
CSFW
2005
IEEE
16 years 3 days ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
148
click to vote
ICALP
2005
Springer
16 years 13 hour ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...