Sciweavers

876 search results - page 4 / 176
» New Results for the Martin Polynomial
Sort
View
EMO
2005
Springer
175views Optimization» more  EMO 2005»
14 years 2 months ago
A New Analysis of the LebMeasure Algorithm for Calculating Hypervolume
We present a new analysis of the LebMeasure algorithm for calculating hypervolume. We prove that although it is polynomial in the number of points, LebMeasure is exponential in the...
R. Lyndon While
RTA
2010
Springer
14 years 14 days ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
ICALP
2005
Springer
14 years 2 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
JCT
2006
81views more  JCT 2006»
13 years 8 months ago
New identities involving Bernoulli and Euler polynomials
Abstract. Using the finite difference calculus and differentiation, we obtain several new identities for Bernoulli and Euler polynomials; some extend Miki's and Matiyasevich&#...
Hao Pan, Zhi-Wei Sun
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 9 months ago
New degree bounds for polynomial threshold functions
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
Ryan O'Donnell, Rocco A. Servedio