Results 11 to 20 of about 381,752 (282)
On the Complexity of the Interlace Polynomial [PDF]
CoRR, 2007 We consider the two-variable interlace polynomial introduced by Arratia, Bollobas and Sorkin (2004). We develop graph transformations which allow us to derive point-to-point reductions for the interlace polynomial.
Christian Hoffmann, Markus Bl, Äser
core +8 more sources
On the Complexity of Noncommutative Polynomial Factorization [PDF]
Information and Computation, 2015 In this paper we study the complexity of factorization of polynomials in the free noncommutative ring $\mathbb{F}\langle x_1,x_2,\dots,x_n\rangle$ of polynomials over the field $\mathbb{F}$ and noncommuting variables $x_1,x_2,\ldots,x_n$.
Arvind, V. +2 more
core +3 more sources
The Complexity of Approximating the Matching Polynomial in the Complex Plane [PDF]
ACM Transactions on Computation Theory, 2021 We study the problem of approximating the value of the matching polynomial on graphs with edge parameter γ, where γ takes arbitrary values in the complex plane. When γ is a positive real, Jerrum and Sinclair showed that the problem admits an FPRAS on general graphs.
Ivona Bezáková +3 more
openaire +5 more sources
On the Complexity of Symmetric Polynomials.
ITCS, 2018 Peer ...
Markus Bläser, Gorav Jindal
openaire +6 more sources
On the Nash equilibrium in the inspector problem
Lietuvos Matematikos Rinkinys, 2014 Inspector problem represents an economic duel of inspector and law violator and is formulated as a bimatrix game. In general, bimatrix game is NP-complete problem.
Martynas Sabaliauskas, Jonas Mockus
doaj +1 more source
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
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
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length [PDF]
, 2016 We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential equations with ...
Bournez, Olivier +2 more
core +3 more sources
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
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