2430 search results - page 108 / 486 » Computing Tutte Polynomials |
133
Voted
CG
2006
Springer
15 years 8 months ago
2006
Springer
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
146
click to vote
CADE
2008
Springer
15 years 7 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
126
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
160
click to vote
MVA
1992
15 years 6 months ago
1992
This paper presents a method to compute Mean and Gaussian curvatures from range images. The first and second partial derivatives are estimated by the weighted least squares fit of...
195
click to vote
FAW
2010
Springer
15 years 5 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...