AMC
2007
13 years 11 months ago
2007
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
ICISC
1998
14 years 24 days ago
1998
Abstract. In 14] and 21] there are proposed ElGamal-type cryptosystems based on non-maximal imaginary quadratic orders with fast trapdoor decryption. The trapdoor information is th...
SODA
2004
ACM
14 years 25 days ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...