Results 1 to 10 of about 1,907,337 (239)

Polynomial Equivalence of Complexity Geometries [PDF]

Quantum
This 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   +3 more sources

The Power of the Lorentz Quantum Computer [PDF]

Entropy
We analyze the power of the recently proposed Lorentz quantum computer (LQC), a theoretical model leveraging hyperbolic bits (hybits) governed by complex Lorentz transformations.
Qi Zhang, Biao Wu
doaj   +2 more sources

A new search direction for full-Newton step infeasible interior-point method in linear optimization

Croatian Operational Research Review, 2023
In this work, we investigate a full Newton step infeasible interior-point method for linear optimization based on a new search direction which is obtained from an algebraic equivalent transformation of the central path system.
Behrouz Kheirfam
doaj   +1 more source

A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique [PDF]

Yugoslav Journal of Operations Research, 2014
In this paper, we present a predictor-corrector path-following interior-point algorithm for symmetric cone optimization based on Darvay's technique.
Kheirfam Behrouz
doaj   +1 more source

New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization [PDF]

Yugoslav Journal of Operations Research, 2018
We present a full Nesterov-Todd (NT) step infeasible interior-point algorithm for second-order cone optimization based on a different way to calculate feasibility direction. In each iteration of the algorithm we use the largest possible barrier parameter
Kheirfam Behrouz
doaj   +1 more source

Stable stellar configurations with polynomial complexity factor

European Physical Journal C: Particles and Fields, 2022
In this article, we present two new families of anisotropic solutions for static spherically symmetric stellar systems by taking into account the implications of complexity factor proposed by Herrera (Phys. Rev.
M. Zubair
doaj   +1 more source

Ultracompact stars with polynomial complexity by gravitational decoupling

European Physical Journal C: Particles and Fields, 2021
In this work we construct an ultracompact star configuration in the framework of Gravitational Decoupling by the Minimal Geometric Deformation approach.
M. Carrasco-Hidalgo, E. Contreras
doaj   +1 more source

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

Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their Generalizations

IEEE Access, 2022
Pseudorandom sequences with large linear complexity have been widely applied in electronic countermeasures, mobile communication and cryptography.
Jiang Ma, Jun Zhang, Yanguo Jia, Xiumin Shen   +3 more
doaj   +1 more source