Results 11 to 20 of about 1,907,337 (239)
On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation Problems. [PDF]
Entropy (Basel), 2021 This paper proposes a method for solving optimisation problems involving piecewise quadratic functions. The method provides a solution in a finite number of iterations, and the computational complexity of the proposed method is locally polynomial of the ...
Prusińska A, Szkatuła K, Tret'yakov A.
europepmc +2 more sources
Space Complexity in Polynomial Calculus [PDF]
, 2012 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 ...
Lauria, Massimo, +4 more
core +7 more sources
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width [PDF]
, 1998 It is known that evaluating the Tutte polynomial, $T(G; x, y)$, of a graph, $G$, is $\#$P-hard at all but eight specific points and one specific curve of the $(x, y)$-plane.
Noble, S D
core +7 more sources
On Upper Bound of the Complexity of Quasi Polynomial Representations of Functions over Finite Fields
Известия Иркутского государственного университета: Серия "Математика", 2014 Representations of functions over finite fields, including polynomial representations, are being actively investigated. The complexity of such representations is one of main directions of research.
A.S. Baliuk
doaj +1 more source
An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree [PDF]
, 2023 While it is known that there is at most a polynomial separation between quantum query complexity and the polynomial degree for total functions, the precise relationship between the two is not clear for partial functions.
Ambainis, Andris, Belovs, Aleksandrs
core +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
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
A simulation algorithm for a single server retrial queuing system with batch arrivals
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 Many systems of real word are modeled by retrial queuing system with batch arrivals. Analytical formulas for this class of systems are complicated and address only particular cases.
Florea Ion, Nǎnǎu Corina-Ştefania
doaj +1 more source
Mathematical Modelling and Analysis, 2018 An arc search interior-point algorithm for monotone symmetric cone linear complementarity problem is presented. The algorithm estimates the central path by an ellipse and follows an ellipsoidal approximation of the central path to reach an ε-approximate ...
Mohammad Pirhaji +3 more
doaj +1 more source