( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Complexity Analysis of Root Clustering for a Complex Polynomial.

, , , , и . ISSAC, стр. 71-78. ACM, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Vikram Mehta

Vikram Menon

Vikram Mavalankar

Naman Sharma

P-O Fit and Employee's Turnover Intentions: Examining the Mediation of Employee Engagement in Indian IT Sector.. Int. J. Hum. Cap. Inf. Technol. Prof., 10 (2): 51-60 (2019)

Anuradha Sharma

 

Другие публикации лиц с тем же именем

Complexity of real root isolation using continued fractions.. Theor. Comput. Sci., 409 (2): 292-310 (2008)Near optimal tree size bounds on a simple real root isolation algorithm., и . ISSAC, стр. 319-326. ACM, (2012)Bounds on absolute positiveness of multivariate polynomials., и . J. Symb. Comput., 45 (6): 617-628 (2010)Complexity Analysis of Root Clustering for a Complex Polynomial., , , , и . ISSAC, стр. 71-78. ACM, (2016)Robust Approximate Zeros., , и . ESA, том 3669 из Lecture Notes in Computer Science, стр. 874-886. Springer, (2005)Complexity of a Root Clustering Algorithm., и . CoRR, (2019)Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model., и . FSTTCS, том 122 из LIPIcs, стр. 45:1-45:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Lower Bound for Computing Lagrange's Real Root Bound., и . CASC, том 9890 из Lecture Notes in Computer Science, стр. 444-456. Springer, (2016)Applications of dimensionality reduction and exponential sums to graph automorphism., и . Theor. Comput. Sci., 412 (29): 3639-3649 (2011)Complexity Analysis of Algorithms in Algebraic Computation.. New York University, USA, (2006)