Results 31 to 40 of about 36,366 (263)
On the additive complexity of polynomials
Theoretical Computer Science, 1980 Translation from Theor. Comput. Sci. 10, 1-18 (English) (1980; Zbl 0469.68044).
Claus-Peter Schnorr +1 more
openaire +3 more sources
Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials
Известия Иркутского государственного университета: Серия "Математика", 2017 One of the directions of the investigation of functions over finite fields is the study of their representations, including polynomial ones. In the area of polynomial representations of functions the problem of estimating the complexity of such ...
A.S. Baliuk, A.S. Zinchenko
doaj +1 more source
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
Uncurrying for Innermost Termination and Derivational Complexity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we investigate how this
Aart Middeldorp +2 more
doaj +1 more source
A full-Newton step feasible interior-point algorithm for P∗(κ)-LCP based on a new search direction
Croatian Operational Research Review, 2016 In this paper, we present a full-Newton step feasible interior-point algorithm for a P∗(κ) linear complementarity problem based on a new search direction.
Behrouz Kheirfam, Masoumeh Haghighi
doaj +1 more source
Fast reconstruction of feedback polynomials for synchronous scramblers in a noisy environment
IET Communications, 2022 As one of the key technologies of modern communication, a linear scrambler is a technique to randomize the data to be transmitted at the bit layer to improve the timing recovery and confidentiality of the transmitted data.
Yong Ding, Zhiping Huang, Jing Zhou
doaj +1 more source
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
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
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
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