Results 21 to 30 of about 3,052,442 (264)
Bounds for sets with no polynomial progressions [PDF]
Forum 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
Problems on multivariate reliability polynomial
Atti 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
The polynomial method strikes back: tight quantum query bounds via dual polynomials [PDF]
Electron. Colloquium Comput. Complex., 2017 The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. The approximate degree of f is known to be a lower bound on the quantum query complexity of f (Beals et al., FOCS ...
Mark Bun, Robin Kothari, J. Thaler
semanticscholar +1 more source
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
Robust stability analysis of DC microgrids with constant power loads [PDF]
American Control Conference, 2017 This paper studies stability analysis of DC microgrids with uncertain constant power loads (CPLs). It is well known that CPLs have negative impedance effects, which may cause instability in a DC microgrid.
Jianzhe Liu, Wei Zhang, G. Rizzoni
semanticscholar +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
Edit Distance with Block Deletions
Algorithms, 2011 Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves.
Dana Shapira, James A. Storer
doaj +1 more source
Nodal sets of Laplace eigenfunctions: polynomial upper estimates of the Hausdorff measure [PDF]
, 2016 Let $\mathbb{M}$ be a compact $C^\infty$-smooth Riemannian manifold of dimension $n$, $n\geq 3$, and let $\varphi_\lambda: \Delta_M \varphi_\lambda + \lambda \varphi_\lambda = 0$ denote the Laplace eigenfunction on $\mathbb{M}$ corresponding to the ...
A. Logunov
semanticscholar +1 more source
The Zhegalkin Polynomial of Multiseat Sole Sufficient Operator
Моделирование и анализ информационных систем, 2023 Among functionally complete sets of Boolean functions, sole sufficient operators are of particular interest. They have a wide range of applicability and are not limited to the two-seat case.
Leonid Y. Bystrov, Egor V. Kuzmin
doaj +1 more source
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