Result 1 to 20 of 170 total
Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials. (English)
Calcolo 49, No. 4, 241-267 (2012).
1
Determining the component number of links corresponding to triangular and honeycomb lattices. (English)
J. Knot Theory Ramifications 21, No. 2, Article ID 1250018, 14 p. (2012).
2
Numerical and symbolical methods for the GCD of several polynomials. (English)
Van Dooren, Paul (ed.) et al., Numerical linear algebra in signals, systems and control. Selected papers based on the presentations at the international workshop, Kharagpur, India, January 9‒11, 2007. In honor of Prof. Biswa Nath Datta. New York, NY: Springer (ISBN 978-94-007-0601-9/hbk; 978-94-007-0602-6/ebook). Lecture Notes in Electrical Engineering 80, 123-144 (2011).
3
Parallel algorithms on greatest common divisor of polynomial system. (Chinese)
J. Jilin Univ., Sci. 49, No. 4, 607-614 (2011).
4
A note on the average number of RSA fixed points. (English)
Theor. Comput. Sci. 412, No. 35, 4729-4737 (2011).
5
Structured matrix based methods for approximate polynomial GCD. (English)
Tesi. Scuola Normale Superiore Pisa (Nuova Serie) 15. Pisa: Edizioni della Normale (Diss. 2007) (ISBN 978-88-7642-380-2/pbk). 250~p. EUR~18.00/net; SFR~30.00; \sterling~15.99; \$~24.95 (2011).
6
An efficient algorithm for solving rank one perturbed linear Diophantine systems using Rosser’s approach. (English)
4OR 9, No. 2, 159-173 (2011).
7
Gcd of multivariate polynomials via Newton polytopes. (English)
Appl. Math. Comput. 217, No. 21, 8377-8386 (2011).
8
On Euclid’s algorithm and elementary number theory. (English)
Sci. Comput. Program. 76, No. 3, 160-180 (2011).
9
The calculation of the degree of an approximate greatest common divisor of two polynomials. (English)
J. Comput. Appl. Math. 235, No. 6, 1587-1603 (2011).
10
Some applications of lattice based root finding techniques. (English)
Adv. Math. Commun. 4, No. 4, 519-531 (2010).
11
On a problem of Pillai and its generalizations. (English)
Acta Arith. 144, No. 4, 323-347 (2010).
12
Counting the regions in a regular drawing of $K_{n,n}$. (English)
J. Integer Seq. 13, No. 8, Article 10.8.5, 8 p., electronic only (2010).
13
A randomized sublinear time parallel GCD algorithm for the EREW PRAM. (English)
Inf. Process. Lett. 110, No. 5, 198-201 (2010).
14
The ERES method for computing the approximate GCD of several polynomials. (English)
Appl. Numer. Math. 60, No. 1-2, 94-114 (2010).
15
Robust estimation of GCD with sparse coefficients. (English)
Signal Process. 90, No. 3, 972-976 (2010).
16
Fixed points of the RSA encryption algorithm. (English)
Theor. Comput. Sci. 411, No. 1, 288-292 (2010).
17
The number of crossings in a regular drawing of the complete bipartite graph. (English)
J. Integer Seq. 12, No. 5, Article ID 09.5.5, 8 p., electronic only (2009).
18
GPGCD, an iterative method for calculating approximate GCD of univariate polynomials, with the complex coefficients. (English)
Suzuki, Masakazu (ed.) et al., The joint conference of ASCM 2009 and MACIS 2009. 9th international conference on Asian symposium on computer mathematics and 3rd international conference on mathematical aspects of computer and information sciences, Fukuoka, Japan, December 14‒17, 2009. Selected papers. Fukuoka: Kyushu University, Faculty of Mathematics. COE Lecture Note 22, 212-221 (2009).
19
Determining the component number of links corresponding to lattices. (English)
J. Knot Theory Ramifications 18, No. 12, 1711-1726 (2009).
20
Result 1 to 20 of 170 total
Start
Contact
Print
General Help
