467 search results - page 37 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
FFA
2008
14 years 12 months ago
2008
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...
88
Voted
IJBC
2006
14 years 11 months ago
2006
This paper deals with the problem of finding upper bounds on the number of periodic solutions of a class of one-dimensional non-autonomous differential equations: those with the r...
102
click to vote
TIT
2008
14 years 11 months ago
2008
This paper gives an information theoretic approach for detecting Byzantine modifications in networks employing random linear network coding. Each exogenous source packet is augmen...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
128
click to vote
AMC
2011
14 years 6 months ago
2011
This is a companion paper of [1] and [2]. In the cited papers, using the C-algorithm introduced in [3], many new examples of isochronous centers for Li´enard type equation are fou...