19320 search results - page 6 / 3864 » On the complexity of computing determinants |
FOCS
1997
IEEE
14 years 1 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...
IANDC
2010
13 years 8 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
We derive a novel method to determine the parameters for regularized super-resolution problems. The proposed approach relies on the Joint Maximum a Posteriori (JMAP) estimation te...
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...