Results 11 to 20 of about 36,366 (263)
Polynomial Equivalence of Complexity Geometries [PDF]
QuantumThis paper proves the polynomial equivalence of a broad class of definitions of quantum computational complexity. We study right-invariant metrics on the unitary group—often called `complexity geometries' following the definition of quantum complexity ...
Adam R. Brown
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
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
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
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
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