363 search results - page 10 / 73 » Finding Small Solutions to Small Degree Polynomials |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
MOC
2000
13 years 7 months ago
2000
Two new families of Reissner-Mindlin triangular finite elements are analyzed. One family, generalizing an element proposed by Zienkiewicz and Lefebvre, approximates (for k 1) the ...
SIAMSC
2008
13 years 7 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
JAT
2002
13 years 7 months ago
2002
Let f C[-1, 1] change its convexity finitely many times, in the interval. We are interested in estimating the degree of approximation of f by polynomials which are coconvex with i...
TIT
2008
13 years 7 months ago
2008
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...