2430 search results - page 163 / 486 » Computing Tutte Polynomials |
150
click to vote
RTCSA
2006
IEEE
15 years 10 months ago
2006
IEEE
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requiremen...
141
click to vote
ISSAC
2005
Springer
15 years 10 months ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
143
click to vote
WG
2004
Springer
15 years 10 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
196
click to vote
STOC
1999
ACM
15 years 9 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
123
click to vote
ICLP
1999
Springer
15 years 9 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...