1 citations · 2 across the 3 of their papers we have counts for
5 papers
Complexity Analysis of Root Clustering for a Complex Polynomial
Ruben Becker, Michael Sagraloff, Vikram Sharma +2
Let be an arbitrary complex polynomial. We introduce the local root clustering problem, to compute a set of natural -clusters of roots of in some box reg…
Isotopic Arrangement of Simple Curves: an Exact Numerical Approach based on Subdivision
Jyh-Ming Lien, Vikram Sharma, Gert Vegter +1
This paper presents the first purely numerical (i.e., non-algebraic) subdivision algorithm for the isotopic approximation of a simple arrangement of curves. The arrangement is "sim…
Generalizing The Davenport-Mahler-Mignotte Bound -- The Weighted Case
Vikram Sharma
Root separation bounds play an important role as a complexity measure in understanding the behaviour of various algorithms in computational algebra, e.g., root isolation algorithms…
Complexity of a Root Clustering Algorithm
Prashant Batra, Vikram Sharma
Approximating the roots of a holomorphic function in an input box is a fundamental problem in many domains. Most algorithms in the literature for solving this problem are condition…
No-Switching Quantum Key Distribution using Broadband Modulated Coherent Light
Andrew M. Lance, Thomas Symul, Vikram Sharma +3
We realize an end-to-end no-switching quantum key distribution protocol using continuous-wave coherent light. We encode weak broadband Gaussian modulations onto the amplitude and p…