Results 41 to 50 of about 381,752 (282)
On the complexity of polynomial matrix computations [PDF]
Proceedings of the 2003 international symposium on Symbolic and algebraic computation, 2003 We study the link between the complexity of polynomial matrix multiplication and the complexity of solving other basic linear algebra problems on polynomial matrices. By polynomial matrices we mean ntimes n matrices in K[x] of degree bounded by d, with K a commutative field. Under the straight-line program model we show that multiplication is reducible
Giorgi, Pascal +2 more
openaire +2 more sources
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
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
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
Complexity Analysis of Root Clustering for a Complex Polynomial [PDF]
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016 Let $F(z)$ be an arbitrary complex polynomial. We introduce the local root clustering problem, to compute a set of natural $\varepsilon$-clusters of roots of $F(z)$ in some box region $B_0$ in the complex plane. This may be viewed as an extension of the classical root isolation problem.
Becker R. +4 more
openaire +3 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
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and PSPACE. Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete (under many-one ...
Christian Herrmann +2 more
doaj +1 more source
, 2002 Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations.
C. H. Bennett +14 more
core +2 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
Complex factorization by Chebysev polynomials
Le Matematiche, 2018 A sequence \((u_n)\) is called \(r\)-periodic if satisfies the recurrence relation \[u_n=a_tu_{n-1}+b_tu_{n-2},\] with \(n \equiv t \pmod r\), for \(n\geq 2\), and given numbers \(a_0,\ldots,a_{r-1},b_0,\ldots,b_{r-1}\), with initial conditions \(u_0\) and \(u_1\).
Sahin, Murat, Tan, Elif, Yilmaz, Semih
openaire +3 more sources