414 search results - page 16 / 83 » On discrete norms of polynomials |
SIAMCOMP
1998
13 years 9 months ago
1998
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
MOC
2000
13 years 9 months ago
2000
Abstract. We propose a discretization scheme for a numerical solution of elliptic PDE's, based on local representation of functions, by their Taylor polynomials (jets). This s...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
COMPGEOM
1999
ACM
14 years 2 months ago
1999
ACM
We propose a speed-up method for discrete-event simulations, including sweep-line or -plane techniques, requiring the repeated calculation of the times at which certain discrete e...
COCOA
2011
Springer
12 years 9 months ago
2011
Springer
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...