19320 search results - page 240 / 3864 » On the complexity of computing determinants |
170
click to vote
TSP
2008
15 years 6 months ago
2008
This paper deals with the design of coded waveforms which optimize radar performances in the presence of colored Gaussian disturbance. We focus on the class of linearly coded puls...
156
click to vote
JACM
2000
15 years 6 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
200
click to vote
ISI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract—Trust is an important yet complex and little understood dyadic relation among actors in a social network. There are many dimensions to trust; trust plays an important ro...
191
click to vote
TIT
2011
15 years 1 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
202
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...