Results 21 to 30 of about 378,739 (288)
Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2002 A P*-Nonlinear Complementarity Problem as a generalization of the P*-Linear Complementarity Problem is considered. We show that the long-step version of the homogeneous self-dual interior-point algorithm could be used to solve such a problem.
Lešaja Goran
doaj +1 more source
Logical Methods in Computer Science, 2020 The complexity of parity games is a long standing open problem that saw a major breakthrough in 2017 when two quasi-polynomial algorithms were published. This article presents a third, independent approach to solving parity games in quasi-polynomial time,
Karoliina Lehtinen, Udi Boker
doaj +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
A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term [PDF]
Yugoslav Journal of Operations Research, 2015 In this paper, we propose a large-update interior-point algorithm for linear optimization based on a new kernel function. New search directions and proximity measure are defined based on this kernel function.
Kheirfam B., Moslemi M.
doaj +1 more source
IEEE Access, 2022 Pseudorandom sequences with large linear complexity have been widely applied in electronic countermeasures, mobile communication and cryptography.
Jiang Ma +3 more
doaj +1 more source
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
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
Complexity of Ising Polynomials [PDF]
Combinatorics, Probability and Computing, 2012 This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and external field. One may consider such an Ising system as a simple graph together with vertex and edge weights.
openaire +3 more sources
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
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