Results 241 to 250 of about 381,752 (282)

Quantum speedup for nonreversible Markov chains. [PDF]

Nat Commun
Claudon B, Piquemal JP, Monmarché P.
europepmc   +1 more source

Learning curves, safety, and experiences of a tertiary surgical center in the introduction of robotic-assisted surgery in gynecologic oncology. [PDF]

Arch Gynecol Obstet
Jung L, Taran FA, Huwer S, Kurz B, Klar M, Favre-Inhofer A, Juhasz-Böss I.   +6 more
europepmc   +1 more source

Energy Efficiency Maximization for ME-IRS-Enabled Secure Communications. [PDF]

Entropy (Basel)
Liu C, Dong L, Li Y, Cheng W.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the Complexity of Polynomial Zeros

SIAM Journal on Computing, 1992
An algorithm for simultaneous approximation of all zeros of a polynomial introduced by Householder is considered. A modification suitable for parallel computation is proposed. The root-finding problem for a polynomial of degree \(n\), having zeros \(z_ i\), \(i=1,\dots,n\) is \(NC\)- reduced to finding a polynomial \(\alpha(z)\) such that \(| \alpha(z_{
Dario Bini, Luca Gemignani
exaly   +4 more sources

The complexity of the characteristic and the minimal polynomial

Theoretical Computer Science, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thanh Minh Hoang, Thomas Thierauf
exaly   +2 more sources

Complexity and Approximability of the Cover Polynomial

computational complexity, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Markus Bläser, Holger Dell, Mahmoud Fouz   +2 more
openaire   +2 more sources

Polynomials and Complex Polynomials

1997
If F is a field and n is a nonnegative integer, then a polynomial of degree n over F is a formal sum of the form $$P(x) = {a_0} + {a_1}x + \cdots + {a_n}{x^n}$$ With a i ∈ F for i = 0, .., n, a n ≠ 0 and x an indeterminate. A polynomial P(χ) over F is either a polynomial of some degree or the expression P(χ) = 0, which is called the zero ...
Benjamin Fine, Gerhard Rosenberger
openaire   +1 more source

Complexity of the Cover Polynomial

2007
The cover polynomial introduced by Chung and Graham is a two-variate graph polynomial for directed graphs. It counts the (weighted) number of ways to cover a graph with disjoint directed cycles and paths, it is an interpolation between determinant and permanent, and it is believed to be a directed analogue of the Tutte polynomial. Jaeger, Vertigan, and
Markus Bläser, Holger Dell
openaire   +1 more source

The Complexity of the Annihilating Polynomial

2009 24th Annual IEEE Conference on Computational Complexity, 2009
Let F be a field and f_1, ..., f_k in F[x_1, ..., x_n] be a set of k polynomials of degree d in n variables over the field F. These polynomials are said to be algebraically dependent if there exists a nonzero k-variate polynomial A(t_1, ..., t_k) in F[t_1, ..., t_k] such that A(f_1, ..., f_k) = 0.
openaire   +1 more source