Results 41 to 50 of about 17,255,193 (320)
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants
Algorithmica, 2018 We present two new data structures for computing values of an n-variate polynomial P of degree at most d over a finite field of q elements. Assuming that d divides q-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage ...
Andreas Björklund +2 more
semanticscholar +1 more source
MECHANICAL STRUCTURAL RELIABILITY ANALYSIS BASED ON POLYNOMIAL CHAOS EXPANSIONS
Jixie qiangdu, 2022 Reliability is one of important index in the analysis and evaluation of mechanical structure. Aiming at the problems of various failure modes and low efficiency of reliability evaluation for complex mechanical structures, the reliability analysis method ...
WANG ZhiMing +4 more
doaj
On the Elementary Affine Lambda-Calculus with and Without Fixed Points [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates.
Lê Thành Dũng Nguyen
doaj +1 more source
On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers [PDF]
, 2007 We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes.
A. Barg +29 more
core +3 more sources
Polynomial graph invariants from homomorphism numbers
, 2013 We give a method of generating strongly polynomial sequences of graphs, i.e., sequences $(H_{\mathbf{k}})$ indexed by a multivariate parameter $\mathbf{k}=(k_1,\ldots, k_h)$ such that, for each fixed graph $G$, there is a multivariate polynomial $p(G;x_1,
Garijo, Delia +2 more
core +1 more source
Evaluation of polynomials with super-preconditioning
Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76, 1976 AbstractCertain questions concerning the arithmetic complexity of univariate polynomial evaluation are considered. The principal technical results show that there exist polynomials f,g, and h with h = fg, such that h requires substantially fewer arithmetic operations than either f or g.
Richard J. Lipton, Larry J. Stockmeyer
openaire +2 more sources
Polynomial evaluation over finite fields: new algorithms and complexity bounds [PDF]
Applicable Algebra in Engineering, Communication and Computing, 2011 An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques, when the degree of the polynomial is large enough compared to the field characteristic. Specifically, if n
M. Elia, J. Rosenthal, D. Schipani
semanticscholar +1 more source
Toward accurate polynomial evaluation in rounded arithmetic [PDF]
, 2005 Given a multivariate real (or complex) polynomial $p$ and a domain $\cal D$, we would like to decide whether an algorithm exists to evaluate $p(x)$ accurately for all $x \in {\cal D}$ using rounded real (or complex) arithmetic.
Demmel, James +2 more
core +4 more sources
On Computational Aspects of Krawtchouk Polynomials for High Orders
Journal of Imaging, 2020 Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property.
Basheera M. Mahmmod +3 more
doaj +1 more source
Long‐Term Follow‐Up of Chemotherapy‐Associated Biological Aging in Women With Early Breast Cancer
Aging and Cancer, EarlyView.Women threated with adjuvant chemotherapy for early breast cancer have sustained long‐term increase in p16INK4a,, a robust marker of cell senescence, suggesting a chemotherapy‐associated age acceleration. p16INK4a as well as other biomarkers may identify patients at greatest risk for senescence‐related diseases of aging.
Hyman B. Muss +12 more
wiley +1 more source