840 search results - page 125 / 168 » The Complexity of the Extended GCD Problem |
143
click to vote
ICCS
2003
Springer
15 years 10 months ago
2003
Springer
Self-Adapting Numerical Software (SANS) systems aim to bridge the knowledge gap that exists between the expertise of domain scientists, and the know-how that is needed to fulfill...
154
Voted
SIGECOM
2010
ACM
15 years 10 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
135
click to vote
MMMACNS
2001
Springer
15 years 9 months ago
2001
Springer
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptoti...
171
click to vote
RE
2001
Springer
15 years 9 months ago
2001
Springer
A domain model describes common and variant requirements for a system family. UML notations used in requirements analysis and software modeling can be extended with “variation p...
140
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...