Results 21 to 30 of about 381,752 (282)
Rigid continuation paths II. structured polynomial systems
Forum of Mathematics, Pi, 2023 This work studies the average complexity of solving structured polynomial systems that are characterised by a low evaluation cost, as opposed to the dense random model previously used.
Peter Bürgisser +2 more
doaj +1 more source
Complex polynomials in engineering
CoRR, 2014 Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their evaluations are time consuming.
Khier Benmahammed +2 more
openaire +2 more sources
A simulation algorithm for a single server retrial queuing system with batch arrivals
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 Many systems of real word are modeled by retrial queuing system with batch arrivals. Analytical formulas for this class of systems are complicated and address only particular cases.
Florea Ion, Nǎnǎu Corina-Ştefania
doaj +1 more source
The Partition Bound for Classical Communication Complexity and Query Complexity [PDF]
, 2009 We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs.
Jain, Rahul, Klauck, Hartmut
core +2 more sources
Mathematical Modelling and Analysis, 2018 An arc search interior-point algorithm for monotone symmetric cone linear complementarity problem is presented. The algorithm estimates the central path by an ellipse and follows an ellipsoidal approximation of the central path to reach an ε-approximate ...
Mohammad Pirhaji +3 more
doaj +1 more source
On semiring complexity of Schur polynomials [PDF]
computational complexity, 2018 Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number of variables is fixed, the semiring complexity of a Schur polynomial $s_λ$ is $O(log(λ_1))$; here $λ_1$ is the largest part of the partition $λ$.
Sergey Fomin +3 more
openaire +4 more sources
Research on Linear Complexity of Quaternary Sequences with Period 2pq [PDF]
Jisuanji gongcheng, 2016 Linear complexity is an important index for measuring the randomness properties of the sequences.Based on the theory of generalized cyclotomic,a new class of quaternary balanced generalized cyclotomic sequences with period 2pq over finite field F4 is ...
WEI Wanyin,DU Xiaoni,WANG Guohui
doaj +1 more source
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
On the Complex and Real Hessian Polynomials [PDF]
International Journal of Mathematics and Mathematical Sciences, 2010 We study some realization problems related to the Hessian polynomials. In particular, we solve the Hessian curve realization problem for degrees zero, one, two, and three and the Hessian polynomial realization problem for degrees zero, one, and two.
Emigdio Martínez-Ojeda +1 more
openaire +3 more sources
Chromatic Polynomials of Simplicial Complexes [PDF]
Graphs and Combinatorics, 2015 We consider s-chromatic polynomials of simplicial complexes, higher dimensional analogues of chromatic polynomials for graphs.
Møller, Jesper Michael, Nord, Gesche
openaire +4 more sources