3k citations · 4.8k across the 14 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Bit Complexity of Jordan Normal Form and Spectral Factorization
Papri Dey, Ravi Kannan, Nick Ryder +1
We study the bit complexity of two related fundamental computational problems in linear algebra and control theory. Our results are: (1) An $\tilde{O}(n^{ω+3}a+n^4a^2+n^ω\log(1/ε))…
cs.DS2016★ 2 cited
Real Stability Testing
Prasad Raghavendra, Nick Ryder, Nikhil Srivastava
We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a…