1380 search results - page 92 / 276 » A General Polynomial Sieve |
STACS
1994
Springer
14 years 2 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
ESA
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
AMC
2007
13 years 10 months ago
2007
In the implementation of subdivision scheme, three of the most important issues are smoothness, size of support, and approximation order. Our objective is to introduce an improved...
CC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
CGF
2008
13 years 10 months ago
2008
In this paper we propose a new kind of Hermite interpolation on arbitrary domains, matching derivative data of arbitrary order on the boundary. The basic idea stems from an interp...