1383 search results - page 65 / 277 » On the Complexity of the Interlace Polynomial |
158
click to vote
VMCAI
2005
Springer
15 years 11 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
167
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
197
click to vote
COCOON
2009
Springer
16 years 23 days ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
205
click to vote
MOBICOM
2006
ACM
16 years 4 days ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
156
click to vote
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...