932 search results - page 79 / 187 » Where in the Wikipedia Is That Answer |
CRYPTO
2007
Springer
14 years 3 months ago
2007
Springer
Wiener’s famous attack on RSA with d < N0.25 shows that using a small d for an efficient decryption process makes RSA completely insecure. As an alternative, Wiener proposed t...
ISAAC
2007
Springer
14 years 3 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
SARA
2007
Springer
14 years 3 months ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
AGILEDC
2006
IEEE
14 years 3 months ago
2006
IEEE
Much of the knowledge used within an XP team is tacit, i.e. it is hidden and intangible. Two tangible artefacts that carry information about the team’s work are the index cards ...