1 citations · 1 across the 2 of their papers we have counts for
5 papers
Matrix Multiplication with Less Arithmetic Complexity and IO Complexity
Pu Wu, Huiqing Jiang, Zehui Shao +1
After Strassen presented the first sub-cubic matrix multiplication algorithm, many Strassen-like algorithms are presented. Most of them with low asymptotic cost have large hidden l…
On a generalization of fractional Langevin equation
Saeed Kosari, Milad Yadollahzadeh, Zehui Shao +1
In this work, we consider a generalization of the nonlinear Langevin equation of fractional orders with boundary value conditions. The existence and uniqueness of solutions are stu…
On the packing coloring of base-3 Sierpiński and graphs
Fei Deng, Zehui Shao, Aleksander Vesel
For a nondecreasing sequence of integers an -packing -coloring of a graph is a mapping from to such that vertices with c…
Changing and unchanging 2-rainbow independent domination
Pu Wu, Zehui Shao, Vladimir Samodivkin +3
For a function we denote by the set of vertices to which the value is assigned by , i.e. . If…
The characterization of perfect Roman domination stable trees
Zepeng Li, Zehui Shao, Yongsheng Rao +2
A \emph{perfect Roman dominating function} (PRDF) on a graph is a function satisfying the condition that every vertex for which $f(…