Results 41 to 50 of about 3,729,724 (366)
Zeros of Fekete polynomials [PDF]
, 1999 The authors study the distribution of zeros of the Fekete polynomial f_p(t) (defined for p prime) as p -> infinity. They show that asymptotically a constant fraction of the zeros lie on the unit circle, and they investigate the constant of ...
Conrey, J. Brian +3 more
core +3 more sources
Unconditional constants and polynomial inequalities
Journal 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
The Constant Inapproximability of the Parameterized Dominating Set Problem [PDF]
, 2015 We prove that there is no fpt-algorithm that can approximate the dominating set problem with any constant ratio, unless FPT= W[1]. Our hardness reduction is built on the second author's recent W[1]-hardness proof of the biclique problem.
Chen, Yijia, Lin, Bingkai
core +1 more source
An Elementary Approach to Polynomial Optimization on Polynomial Meshes
Journal 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
NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials [PDF]
An $s$-sparse polynomial has at most $s$ monomials with nonzero coefficients. The Equivalence Testing problem for sparse polynomials (ETsparse) asks to decide if a given polynomial $f$ is equivalent to (i.e., in the orbit of) some $s$-sparse polynomial.
Omkar Baraskar +3 more
openalex +5 more sources
Secure Distributed Computing With Straggling Servers Using Polynomial Codes
IEEE Transactions on Information Forensics and Security, 2019 In this paper, we consider a secure distributed computing scenario in which a master wants to perform matrix multiplication of confidential inputs with multiple workers in parallel.
Heecheol Yang, Jungwoo Lee
semanticscholar +1 more source
A Polynomial Curve of Constant Width
Missouri Journal of Mathematical Sciences, 1997 S. Rabinowitz
semanticscholar +3 more sources
Fast constant-time gcd computation and modular inversion
IACR Cryptology ePrint Archive, 2019 This paper introduces streamlined constant-time variants of Euclid’s algorithm, both for polynomial inputs and for integer inputs. As concrete applications, this paper saves time in (1) modular inversion for Curve25519, which was previously believed to ...
D. Bernstein, Bo-Yin Yang
semanticscholar +1 more source
Constant terms of powers of a Laurent polynomial
Indagationes Mathematicae, 1998 The following is a conjecture of O. Mathieu: Let \(K\) be a connected real compact Lie group. Let \(f\) and \(g\) be \(K\)-finite functions on \(K\). Assume for all \(n \geq 1\) that the constant term of \(f^{n}\) vanishes, i.e. \[ \int_{K} f^{n}(k) \;dk = 0 .
J. Duistermaat, W. Kallen
semanticscholar +4 more sources
Relating Polynomial Time to Constant Depth
Theoretical Computer Science, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
H. Vollmer
semanticscholar +3 more sources