Results 41 to 50 of about 378,739 (288)
Polynomial complexity despite the fermionic sign
, 2017 It is commonly believed that in quantum Monte Carlo approaches to fermionic many- body problems, the infamous sign problem generically implies prohibitively large computational times for obtaining thermodynamic-limit quantities.
Prokof'ev, N. +4 more
core +1 more source
Extremal sequences of polynomial complexity [PDF]
, 2013 The joint spectral radius of a bounded set of $d \times d$ real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn from that set is
Hare, Kevin G. +2 more
core +2 more sources
Linear Complexity of the Balanced Polynomial Quotients Sequences
MATEC Web of Conferences, 2018 Balanced binary sequences of large linear complexity have series applications in communication systems. In the past, although the sequences derived from polynomial quotients have large linear complexity, but they are not balanced.
Zhao Chun-e, Yan Tongjiang, Niu Qihua
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Cognitive decline is a disabling and variable feature of Parkinson disease (PD). While cholinergic system degeneration is linked to cognitive impairments in PD, most prior research reported cross‐sectional associations. We aimed to fill this gap by investigating whether baseline regional cerebral vesicular acetylcholine transporter ...
Taylor Brown +6 more
wiley +1 more source
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs [PDF]
, 2015 A read-once oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly
Gurjar, Rohit +3 more
core +3 more sources
Advanced Engineering Materials, EarlyView.Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt +8 more
wiley +1 more source
On the Complexity of Noncommutative Polynomial Factorization
, 2015 In this paper we study the complexity of factorization of polynomials in the free noncommutative ring $\mathbb{F}\langle x_1,x_2,\dots,x_n\rangle$ of polynomials over the field $\mathbb{F}$ and noncommuting variables $x_1,x_2,\ldots,x_n$.
Arvind, V. +2 more
core +1 more source
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion [PDF]
, 2009 In (Kabanets, Impagliazzo, 2004) it is shown how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit multilinear polynomial family for arithmetical circuits.
Jansen, Maurice
core +6 more sources
Sparse complex polynomials and polynomial reducibility
Journal of Computer and System Sciences, 1977 We show that certain problems involving sparse polynomials with integer coefficients are at least as hard as any problem in NP. These problems include determining the degree of the least common multiple of a set of such polynomials, and related problems. The proofs make use of a homomorphism from Boolean expressions over the predicate symbols {P1,…,Pn}
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Curvature‐tuned auxetic lattices are designed, fabricated, and mechanically characterized to reveal how geometric curvature governs stretchability, stress redistribution, and Poisson's ratio evolution. Photoelastic experiments visualize stress pathways, while hyperelastic simulations quantify deformation mechanics.
Shuvodeep De +3 more
wiley +1 more source