1998 search results - page 28 / 400 » Complexity of the Cover Polynomial |
144
click to vote
MST
2010
15 years 2 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...
122
click to vote
ICDE
2010
IEEE
15 years 11 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...