Results 1 to 10 of about 985 (69)
On the general position number of two classes of graphs
Open Mathematics, 2022 The general position problem is to find the cardinality of the largest vertex subset SS such that no triple of vertices of SS lies on a common geodesic.
Yao Yan, He Mengya, Ji Shengjin
doaj +1 more source
Tractable Combinations of Temporal CSPs [PDF]
Logical Methods in Computer Science, 2022 The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T.
Manuel Bodirsky +2 more
doaj +1 more source
A deterministic algorithm for the discrete logarithm problem in a semigroup
Journal of Mathematical Cryptology, 2022 The discrete logarithm problem (DLP) in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have a time complexity of O(NlogN)O\left(\sqrt{N}\log N) and a space complexity of O(N)O\left ...
Tinani Simran, Rosenthal Joachim
doaj +1 more source
On stochastic accelerated gradient with convergence rate
Open Mathematics, 2022 This article studies the regression learning problem from given sample data by using stochastic approximation (SA) type algorithm, namely, the accelerated SA.
Zha Xingxing +2 more
doaj +1 more source
More on the Rainbow Disconnection in Graphs
Discussiones Mathematicae Graph Theory, 2022 Let G be a nontrivial edge-colored connected graph. An edge-cut R of G is called a rainbow-cut if no two of its edges are colored the same. An edge-colored graph G is rainbow disconnected if for every two vertices u and v of G, there exists a u-v-rainbow-
Bai Xuqing +3 more
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
Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
Open Mathematics, 2023 We consider the problem of scheduling jobs with equal lengths and arbitrary sizes on uniform parallel batch machines with different capacities. Each machine can only process the jobs whose sizes are not larger than its capacity.
Xin Xiao +2 more
doaj +1 more source
First-Order Methods for Convex Optimization
EURO Journal on Computational Optimization, 2021 First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various
Pavel Dvurechensky +2 more
doaj +1 more source
Algorithmic Aspects of Secure Connected Domination in Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan +1 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2020 If S = (a1, a2, . . .) is a non-decreasing sequence of positive integers, then an S-packing coloring of a graph G is a partition of V (G) into sets X1, X2, . . .
Brešar Boštjan +3 more
doaj +1 more source