Sciweavers

1004 search results - page 22 / 201
» Product representations of polynomials
Sort
View
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 7 months ago
A parametric representation of totally mixed Nash equilibria
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
Gabriela Jeronimo, Daniel Perrucci, Juan Sabia
JSC
2000
69views more  JSC 2000»
13 years 7 months ago
Generic Polynomials with Few Parameters
We call a polynomial g(t1, . . . , tm, X) over a field K generic for a group G if it has Galois group G as a polynomial in X, and if every Galois field extension N/L with K L and...
Gregor Kemper, Elena Mattig
SODA
2000
ACM
106views Algorithms» more  SODA 2000»
13 years 8 months ago
Algorithms for optimizing production DNA sequencing
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
Éva Czabarka, Goran Konjevod, Madhav V. Mar...
FOCS
2005
IEEE
14 years 29 days ago
Learning mixtures of product distributions over discrete domains
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...
Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
CAV
2009
Springer
132views Hardware» more  CAV 2009»
14 years 7 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas