1998 search results - page 182 / 400 » Complexity of the Cover Polynomial |
158
click to vote
ICLP
2004
Springer
15 years 12 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
142
click to vote
ECCC
2010
15 years 6 months ago
2010
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
172
click to vote
ECCC
2006
15 years 6 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
186
click to vote
ADCM
2011
15 years 1 months ago
2011
Abstract: The Wendland radial basis functions [8, 9] are piecewise polynomial compactly supported reproducing kernels in Hilbert spaces which are norm–equivalent to Sobolev space...