Results 51 to 60 of about 378,939 (286)
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
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
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
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
A Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller
International Journal of Adaptive Control and Signal Processing, EarlyView.Block Diagram of the Robust Adaptive One‐Sample‐Ahead Preview Super‐Twisting Sliding Mode Controller. ABSTRACT This article introduces a discrete‐time robust adaptive one‐sample‐ahead preview super‐twisting sliding mode controller. A stability analysis of the controller by Lyapunov criteria is developed to demonstrate its robustness in handling both ...
Guilherme Vieira Hollweg +5 more
wiley +1 more source
Lacunaryx: Computing bounded-degree factors of lacunary polynomials [PDF]
, 2015 In this paper, we report on an implementation in the free software Mathemagix of lacunary factorization algorithms, distributed as a library called Lacunaryx.
Grenet, Bruno
core +2 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.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
Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem
Journal of Numerical Analysis and Approximation Theory, 2011 In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented.
Mohamed Achache, Naima Boudiaf
doaj +2 more sources