1383 search results - page 219 / 277 » On the Complexity of the Interlace Polynomial |
115
click to vote
COCO
2007
Springer
15 years 8 months ago
2007
Springer
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
124
click to vote
COLT
2007
Springer
15 years 8 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
120
click to vote
CSCLP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
122
click to vote
EPIA
2007
Springer
15 years 8 months ago
2007
Springer
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
104
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...