Result 1 to 20 of 133 total
Root finding with threshold circuits. (English)
Theor. Comput. Sci. 462, 59-69 (2012).
1
Cryptanalysis and improvement of an access control in user hierarchy based on elliptic curve cryptosystem. (English)
Inf. Sci. 209, 80-92 (2012).
2
Real and complex polynomial root-finding by means of eigen-solving. (English)
Gerdt, Vladimir P. (ed.) et al., Computer algebra in scientific computing. 14th international workshop, CASC 2012, Maribor, Slovenia, September 3‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32972-2/pbk). Lecture Notes in Computer Science 7442, 271-282 (2012).
3
A fitting algorithm for real coefficient polynomial rooting. (English)
J. Comput. Appl. Math. 236, No. 13, 3238-3255 (2012).
4
The Padé iterations for the matrix sign function and their reciprocals are optimal. (English)
Linear Algebra Appl. 436, No. 3, 472-477 (2012).
5
Proxy signature scheme based on braid group. (Chinese)
J. Comput. Appl. 31, No. 11, 2979-2982 (2011).
6
Efficient Euclidean projections via Piecewise Root Finding and its application in gradient projection. (English)
Neurocomputing 74, No. 17, 2754-2766 (2011).
7
Sparse optimization with least-squares constraints. (English)
SIAM J. Optim. 21, No. 4, 1201-1229 (2011).
8
A relationship between the Lipschitz constants appearing in Taylor’s formula. (English)
J. Korean Soc. Math. Educ., Ser. B, Pure Appl. Math. 18, No. 4, 345-351 (2011).
9
Using multidimensional solvers for optimal data partitioning on dedicated heterogeneous HPC platforms. (English)
Malyshkin, Victor (ed.), Parallel computing technologies. 11th international conference, PaCT 2011, Kazan, Russia, September 19-23, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23177-3/pbk). Lecture Notes in Computer Science 6873, 332-346 (2011).
10
Advice coins for classical and quantum computation. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 61-72 (2011).
11
Dynamics of a higher-order family of iterative methods. (English)
J. Complexity 27, No. 2, 221-229 (2011).
12
Solving cubics by polynomial fitting. (English)
J. Comput. Appl. Math. 235, No. 9, 3033-3052 (2011).
13
Stochastic root finding and efficient estimation of convex risk measures. (English)
Oper. Res. 58, No. 5, 1505-1521 (2010).
14
Computing the Hausdorff distance between two B-spline curves. (English)
Comput.-Aided Des. 42, No. 12, 1197-1206 (2010).
15
Piecewise-smooth chebfuns. (English)
IMA J. Numer. Anal. 30, No. 4, 898-916 (2010).
16
Some new root-finding methods with eighth-order convergence. (English)
Bull. Math. Soc. Sci. Math. Roum., Nouv. Sér. 53(101), No. 2, 133-143 (2010).
17
Introduction to automatic differentiation and MATLAB object-oriented programming. (English)
SIAM Rev. 52, No. 3, 545-563 (2010).
18
A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity. (English)
Proc. Am. Math. Soc. 138, No. 6, 1897-1906 (2010).
19
Numerical methods in engineering with Python. 2nd ed. (English)
Cambridge: Cambridge University Press (ISBN 978-0-521-19132-6/pbk). x, 422~p. \sterling~55.00 (2010).
20
Result 1 to 20 of 133 total
Start
Contact
Print
General Help
