Results 41 to 50 of about 378,939 (286)
On the complexity of integer polynomial recursive sequences
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2022 Background. Linear recursive sequences represent the “classic'” object of combinatorial analysis. To express an arbitrary term of a linear recursive sequence, there are exact formulas of exponential type as in the case of a field of complex numbers ...
S.S. Marchenkov
doaj +1 more source
Some Polynomials for Complex Quadrature [PDF]
Mathematics of Computation, 1971 Equal-weight Chebyshev quadrature is not generally used because the nodes become complex for large n. However, interest in these schemes remains because of recent work on minimal norm quadrature as well as schemes for doing real integrals of analytic functions by complex methods.
openaire +1 more source
Depth-4 Lower Bounds, Determinantal Complexity : A Unified Approach [PDF]
, 2013 Tavenas has recently proved that any n^{O(1)}-variate and degree n polynomial in VP can be computed by a depth-4 circuit of size 2^{O(\sqrt{n}\log n)}. So to prove VP not equal to VNP, it is sufficient to show that an explicit polynomial in VNP of degree
Chillara, Suryajith +1 more
core +2 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
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 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
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
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