2766 search results - page 189 / 554 » Algorithms for trigonometric polynomials |
149
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
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...
113
click to vote
EWC
2007
15 years 4 months ago
2007
In numerous instances, accurate algorithms for approximating the original geometry is required. One typical example is a circle involute curve which represents the underlying geom...
129
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
133
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
139
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...