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 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
On Generalisation of Polynomials in Complex Plane [PDF]
Advances in Decision Sciences, 2010 The generalised Bell and Laguerre polynomials of fractional-order in complex z-plane are defined. Some properties are studied. Moreover, we proved that these polynomials are univalent solutions for second order differential equations. Also, the Laguerre-type of some special functions are introduced.
Maslina Darus, Rabha W. Ibrahim
openaire +1 more source
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
Complex Interpolating Polynomials [PDF]
Proceedings of the American Mathematical Society, 1988 Let I n , m ( f , z ) {I_{n,m}}\left ( {f,z} \right ) be the unique interpolatory polynomial of degree ≤ 2 n − 1
openaire +1 more source
A Finite-Model-Theoretic View on Propositional Proof Complexity [PDF]
Logical Methods in Computer Science, 2022 We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the ...
Erich Grädel +3 more
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
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
Computing the bound of an Ore polynomial. Applications to factorization
, 2018 We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a factorization ...
Gomez-Torrecillas, Jose +2 more
core +1 more source
How to determine linear complexity and $k$-error linear complexity in some classes of linear recurring sequences [PDF]
, 2008 Several fast algorithms for the determination of the linear complexity of $d$-periodic sequences over a finite field $\F_q$, i.e. sequences with characteristic polynomial $f(x) = x^d-1$, have been proposed in the literature. In this contribution fast
A. Salagean +20 more
core +2 more sources