896 search results - page 79 / 180 » On completeness of word reversing |
87
Voted
4OR
2005
15 years 21 days ago
2005
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...
140
click to vote
IPL
2007
15 years 21 days ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
108
click to vote
JCB
2000
15 years 18 days ago
2000
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
129
Voted
AI
2011
Springer
14 years 7 months ago
2011
Springer
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
111
Voted
TCS
2011
14 years 7 months ago
2011
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...