Results 21 to 30 of about 3,572,424 (305)

Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor [PDF]

open access: yesJACM, 2010
Ye [2011] showed recently that the simplex method with Dantzig’s pivoting rule, as well as Howard’s policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount factor, in strongly polynomial time.
Thomas Dueholm Hansen   +2 more
semanticscholar   +1 more source

Hamming distance from irreducible polynomials over $\mathbb {F}_2$ [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2007
We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irreducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general ...
Gilbert Lee   +2 more
doaj   +1 more source

Bounds for sets with no polynomial progressions [PDF]

open access: yesForum of Mathematics, Pi, 2019
Let $P_1,\dots ,P_m\in \mathbb{Z} [y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset A of $\{1,\dots ,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots ,x+P_m(y)$ has size $|A|\ll N/(\log ...
Sarah Peluse
semanticscholar   +1 more source

Polynomial-degree-robust $\protect H({\protect \bf curl})$-stability of discrete minimization in a tetrahedron

open access: yesComptes Rendus. Mathématique, 2021
We prove that the minimizer in the Nédélec polynomial space of some degree $p\ge 0$ of a discrete minimization problem performs as well as the continuous minimizer in $H({\bf curl})$, up to a constant that is independent of the polynomial degree $p$. The
Chaumont-Frelet, Théophile   +2 more
doaj   +1 more source

A Non-NP-Complete Algorithm for a Quasi-Fixed Polynomial Problem

open access: yesAbstract and Applied Analysis, 2013
Let be a real-valued polynomial function of the form , with degree of in An irreducible real-valued polynomial function and a nonnegative integer are given to find a polynomial function satisfying the following expression: for some constant .
Yi-Chou Chen, Hang-Chin Lai
doaj   +1 more source

Meromorphic function sharing a small function with a linear differential polynomial [PDF]

open access: yesMathematica Bohemica, 2016
The problem of uniqueness of an entire or a meromorphic function when it shares a value or a small function with its derivative became popular among the researchers after the work of Rubel and Yang (1977).
Indrajit Lahiri, Amit Sarkar
doaj   +1 more source

A Polynomial Curve of Constant Width

open access: yesMissouri Journal of Mathematical Sciences, 1997
S. Rabinowitz
openaire   +3 more sources

Problems on multivariate reliability polynomial

open access: yesAtti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2017
The original results include: (i) homogenization of a reliability polynomial; (ii) compact hypersurfaces attached to homogeneous polynomials; (iii) an affine diffeomorphism that preserves a reliability polynomial; (iv) duality of networks via a ...
Constantin Udriste   +2 more
doaj   +1 more source

Unconditional constants and polynomial inequalities

open access: yesJournal of Approximation Theory, 2009
If \(P\) is a polynomial with real coefficients, \(|P|\) denotes the polynomial obtained from \(P\) replacing its coefficients by their absolute values. Inequalities between the norm of \(|P|\) and the norm of \(P\) on a convex subset are studied for some specific spaces of polynomials.
Grecu, Bogdan, Munoz, G., Seoane, J.
openaire   +4 more sources

An Elementary Approach to Polynomial Optimization on Polynomial Meshes

open access: yesJournal of Mathematical and Fundamental Sciences, 2018
A polynomial mesh on a multivariate compact set or manifold is a sequence of finite norming sets for polynomials whose norming constant is independent of degree.
Marco Vianello
doaj   +1 more source

Home - About - Disclaimer - Privacy