840 search results - page 80 / 168 » The Complexity of the Extended GCD Problem |
AAAI
2000
13 years 9 months ago
2000
Certain problems in connection with, for example, cooperating agents and distributed systems require reasoning about time which is measured on incomparable or unsynchronized time ...
ECCB
2008
IEEE
13 years 8 months ago
2008
IEEE
Abstract: Models of the dynamics of cellular interaction networks have become increasingly larger in recent years. Formal verification based on model checking provides a powerful t...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
COMCOM
2006
13 years 8 months ago
2006
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
ISCI
2008
13 years 8 months ago
2008
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...