The Power of the Lorentz Quantum Computer [PDF]
EntropyWe 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
The complexity of the characteristic and the minimal polynomial
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thanh Minh Hoang, Thomas Thierauf
exaly +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
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 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$. Our main results are the following.
Vikraman Arvind +2 more
openaire +3 more sources
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
Space Complexity in Polynomial Calculus [PDF]
SIAM Journal on Computing, 2012 Summary: During the last 10 to 15 years, an active line of research in proof complexity has been to study space complexity and time-space trade-offs for proofs. Besides being a natural complexity measure of intrinsic interest, space is also an important concern in SAT solving, and so research has mostly focused on weak systems that are used by SAT ...
Yuval Filmus +4 more
openaire +5 more sources