2430 search results - page 177 / 486 » Computing Tutte Polynomials |
147
click to vote
TCC
2004
Springer
15 years 10 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
139
click to vote
DAM
2007
15 years 4 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
140
click to vote
TCC
2009
Springer
16 years 5 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
143
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
121
click to vote
PR
2006
15 years 4 months ago
2006
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...