1243 search results - page 29 / 249 » Complexity reduction of C-Algorithm |
148
click to vote
CSR
2009
Springer
15 years 11 months 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...
246
click to vote
MST
2011
14 years 7 months ago
2011
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 pol...
117
click to vote
COCO
1989
Springer
15 years 8 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
129
click to vote
JAIR
2008
15 years 4 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
105
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— We investigate nonlinear precoding techniques for the downlink of multi-user systems from a transmitter equipped with multiple antennas to non-cooperative single antenna mobile...