Results 1 to 10 of about 381,603 (139)
Logical Methods in Computer Science, 2013 This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is applicable in two ...
Martin Avanzini, Georg Moser
doaj +3 more sources
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
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
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
Space complexity in polynomial calculus [PDF]
, 2015 During the last decade, 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 issue in SAT ...
Filmus, Yuval +4 more
core +2 more sources
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