Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

89

Voted

ISSAC
2007
Springer

103views Mathematics» more ISSAC 2007»

The nearest polynomial of lower degree

15 years 9 months ago

The nearest polynomial of lower degree

Download www.apmaths.uwo.ca

Robert M. Corless, Nargol Rezvani

Real-time Traffic

ISSAC 2007 |

claim paper

Related Content

» Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials

» Polynomial Degree vs Quantum Query Complexity

» New degree bounds for polynomial threshold functions

» Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle

» An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching

» Indexing SpatioTemporal Trajectories with Chebyshev Polynomials

» Interpolation of the Elliptic Curve DiffieHellman Mapping

» A Lower Bound for Testing 3Colorability in BoundedDegree Graphs

» Sparse squares of polynomials

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	ISSAC
Authors	Robert M. Corless, Nargol Rezvani

Comments (0)