1998 search results - page 101 / 400 » Complexity of the Cover Polynomial |
CAGD
2008
13 years 10 months ago
2008
A plane algebraic curve can be represented as the zero-set of a polynomial in two - or if one takes homogenous coordinates: three - variables. The coefficients of the polynomial de...
COCO
2007
Springer
14 years 4 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
IS
2010
13 years 8 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
SAT
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
WADS
2007
Springer
14 years 4 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...