Efficiently Computing Real Roots of Sparse Polynomials

[1704.06979] Efficiently Computing Real Roots of Sparse Polynomials

We propose an efficient algorithm to compute the real roots of a sparse polynomial f\in\mathbb{R}[x] having k non-zero real-valued coefficients.

Efficiently Computing Real Roots of Sparse Polynomials - Gorav Jindal

ABSTRACT. We propose an efficient algorithm to compute the real roots of a sparse polynomial f ∈ R[x] having k non-zero real-valued coef- ficients.

Efficiently Computing Real Roots of Sparse Polynomials

Abstract. We propose an efficient algorithm to compute the real roots of a sparse polynomial f∈R[x] having k non-zero real-valued coefficients. It is assumed ...

[PDF] Efficiently Computing Real Roots of Sparse Polynomials

An efficient algorithm to compute the real roots of a sparse polynomial f∈R[x] having k non-zero real-valued coefficients, assumed that arbitrarily good ...

Efficiently Computing Real Roots of Sparse Polynomials | Request ...

We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in\mathbb{R}[x]$ having $k$ non-zero real-valued coefficients.

(Open Access) Efficiently Computing Real Roots of Sparse ...

We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in\mathbb{R}[x]$ having $k$ non-zero real-valued coefficients.

Efficiently Computing Real Roots of Sparse Polynomials - CORE

Efficiently Computing Real Roots of Sparse Polynomials. Authors. Becker Ruben · Jr Hendrik W. McNamee J.M.. Publication date: 1 January 2017. Publisher.

Efficiently Computing Real Roots of Sparse Polynomials :: MPG.PuRe

Author: Jindal, Gorav et al.; Genre: Conference Paper; Issued: 2017; Title: Efficiently Computing Real Roots of Sparse Polynomials.

Computing Real Roots of Sparse Polynomials by Gorav Jindal

... Polynomial Identity Testing: Given an algebraic circuit C, can we test efficiently if the circuit C is computing the zero polynomial? (Or ...

Computing real roots of real polynomials - ScienceDirect.com

Our algorithm computes isolating intervals for the real roots of any real square-free polynomial, given by an oracle that provides arbitrary good ...

Efficiently Computing Real Roots of Sparse Polynomials - CORE

Abstract. We propose an efficient algorithm to compute the real roots of a sparse polynomial f ∈ R [ x ] f\in\mathbb{R}[x] f∈R[x] having k k k non-zero ...

Efficient algorithm to compute resultants of sparse polynomials?

In a more general context, I'm using the resultant to check if f and g share a root. Is there another method to check this, considering the ...

A near-optimal algorithm for computing real roots of sparse ...

Hence, for sufficiently sparse polynomials (i.e. k = O(logc(nτ)) for a constant c), the bit complexity is Õ(nτ), which is optimal up to logarithmic factors.

[PDF] A near-optimal algorithm for computing real roots of sparse ...

This paper gives a deterministic, complete, and certified algorithm that determines isolating intervals for all real roots of p with many exact arithmetic ...

Computing isolated roots of sparse polynomial systems in affine space

We present a symbolic probabilistic algorithm to compute the isolated roots in Cn of sparse polynomial equation systems. As some already known numerical ...

A Near-Optimal Algorithm for Computing Real Roots of Sparse ...

Let p ∈ Z[x] be an arbitrary polynomial of degree n with k non-zero integer coefficients of absolute value less than 2τ . In this paper, we ...

On Some Computations on Sparse Polynomials - DROPS

Another milestone in sparse polynomial factorization is computing a root of a sparse polynomial. ... The efficient division algorithm gives rise to an efficient ...

how many zeros of a random sparse polynomial are real?

The arithmetic of sparse polynomials has been of special interest in computer science and the algorithms for efficiently finding roots of sparse polynomials ...

Counting Real Roots in Polynomial-Time via Diophantine ...

... real root counting for sparse polynomial systems may imply a ... [59] Gorav Jindal and Mikael Sagraloff, “Efficiently computing real roots of sparse polynomials,” ...

Counting Real Roots in Polynomial-Time via Diophantine ...

Gorav Jindal and Mikael Sagraloff, “Efficiently computing real roots of sparse polynomials,” in: Proceedings of the 2017 ACM ISSAC ...