137 search results - page 5 / 28 » Probabilistic algorithm for finding roots of linearized poly... |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
JSC
2010
13 years 6 months ago
2010
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
ISSAC
1997
Springer
13 years 11 months ago
1997
Springer
We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...