1092 search results - page 159 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
168
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
163
click to vote
ECML
2003
Springer
15 years 11 months ago
2003
Springer
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
190
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
161
click to vote
ASIACRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Construction of secure hyperelliptic curves is of most important yet most difficult problem in design of cryptosystems based on the discrete logarithm problems on hyperel...
142
click to vote
ICLP
1999
Springer
15 years 10 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...