1383 search results - page 172 / 277 » On the Complexity of the Interlace Polynomial |
156
click to vote
ICC
2007
IEEE
16 years 22 days ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
172
click to vote
INFOCOM
2007
IEEE
16 years 22 days ago
2007
IEEE
Abstract— The performance of scheduling schemes in multihop wireless networks has attracted significant attention in the recent literature. It is well known that optimal schedul...
145
click to vote
IPPS
2007
IEEE
16 years 21 days ago
2007
IEEE
Recently, many parallel computing models using dynamically reconfigurable electrical buses have been proposed in the literature. The underlying characteristics are similar among ...
192
click to vote
CSL
2007
Springer
16 years 18 days ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
142
click to vote
FUN
2007
Springer
16 years 17 days ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...