4403 search results - page 39 / 881 » Galois Theory of Algorithms |
156
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
160
click to vote
COLING
1990
15 years 7 months ago
1990
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...
105
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this article we present a refined summation theory based on Karr's difference field approach. The resulting algorithms find sum representations with optimal nested depth. ...
185
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
163
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...