2430 search results - page 165 / 486 » Computing Tutte Polynomials |
124
click to vote
WABI
2007
Springer
15 years 11 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
122
click to vote
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
149
click to vote
CRYPTO
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
144
click to vote
EUROCRYPT
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSRbased s...
139
click to vote
SIROCCO
2008
15 years 6 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...