2430 search results - page 270 / 486 » Computing Tutte Polynomials |
112
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
133
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
121
click to vote
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
145
click to vote
RTA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
124
click to vote
SDMW
2004
Springer
15 years 9 months ago
2004
Springer
With the increasing use of web services, many new challenges concerning data security are becoming critical. Data or applications can now be outsourced to powerful remote servers, ...