On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. [Citation Graph (, )][DBLP]
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). [Citation Graph (, )][DBLP]
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. [Citation Graph (, )][DBLP]
Simplification of Numerical Rational Surfaces. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP