13603 search results - page 267 / 2721 » On the Complexity of Computing Treelength |
169
click to vote
CSR
2009
Springer
16 years 17 days ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
135
click to vote
MFCS
2009
Springer
16 years 16 days ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
144
click to vote
SAGT
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
133
click to vote
FOCS
2007
IEEE
16 years 9 days ago
2007
IEEE
Broadcast among n parties in the presence of t ≥ n/3 malicious parties is possible only with some additional setup. The most common setup considered is the existence of a PKI an...
147
click to vote
ICC
2007
IEEE
16 years 9 days ago
2007
IEEE
— Forward Error Correction (FEC) schemes are generally used in wireless communication systems to maintain an acceptable quality of service. Various models have been proposed in l...