Sciweavers

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

72

Voted

JAT
2006

49views more JAT 2006»

On discrete norms of polynomials

15 years 3 months ago

On discrete norms of polynomials

Download shell.cas.usf.edu

Evguenii Rakhmanov, Boris Shekhtman

Real-time Traffic

JAT 2006 |

claim paper

Related Content

» Convergence rates to the discrete travelling wave for relaxation schemes

» Computing the Irreducible Real Factors and Components of an Algebraic Curve

» hpOptimal discontinuous Galerkin methods for linear elliptic problems

» Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots

» Complexity of deciding bisimilarity between normed BPA and normed BPP

» Branching Bisimilarity between FiniteState Systems and BPA or Normed BPP Is PolynomialTime...

» Norms XOR Lemmas and Lower Bounds for Polynomials and Protocols

» Norms XOR Lemmas and Lower Bounds for GF2 Polynomials and Multiparty Protocols

» Norm invariant discretization for sampleddata fault detection

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JAT
Authors	Evguenii Rakhmanov, Boris Shekhtman

Comments (0)