Results 221 to 230 of about 36,366 (263)

Fault Tree Reliability Analysis via Squarefree Polynomials: Mathematical and Experimental Analysis. [PDF]

SN Comput Sci
Lopuhaä-Zwakenberg M.
europepmc   +1 more source

Development of machine learning predictive models for estimating pharmaceutical solubility in supercritical CO₂: case study on lornoxicam solubility. [PDF]

Front Chem
Chao L, Wang Y, Erta B, Guo W, Wang H, Zhao C, Yang Y.   +6 more
europepmc   +1 more source

Enhancing bioinformatics engineering by utilizing graph therapeutic properties for clinically approved antitoxin drugs in zoonotic diseases. [PDF]

Sci Rep
Imran M, Aqib M, Malik MA, Jutt S.
europepmc   +1 more source

A robust multi-location evaluation of a machine learning framework for wind power forecasting. [PDF]

PLoS One
Ali U, Sufyan M, Ali S, Ahmad M, Rehman Khan SU, Raza N, Sultana J, Habib MA.   +7 more
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_{
Luca Gemignani, Dario Andrea Bini
exaly   +4 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 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

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 Minimal Polynomial

2001
We investigate the computational complexity of the minimal polynomial of an integer matrix. We show that the computation of the minimal polynomial is in AC0(GapL), the AC0-closure of the logspace counting class GapL, which is contained in NC2. Our main result is that the problem is hard for GapL (under AC0 many-one reductions). The result extends to
Thanh Minh Hoang, Thomas Thierauf
openaire   +2 more sources