1998 search results - page 28 / 400 » Complexity of the Cover Polynomial |
NETWORKS
2008
13 years 9 months ago
2008
NETWORKS
2008
13 years 9 months ago
2008
VLSISP
2010
13 years 4 months ago
2010
MST
2010
13 years 8 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract—We introduce schema covering, the problem of identifying easily understandable common objects for describing large and complex schemas. Defining transformations between...