Yaroslav Shitov

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 25

Top Topics

Positive Semidefinite

Complexity Theory

Matrix Factorisation

Top Venues

J. Comb. Theory, Ser. A

Publications

Yaroslav Shitov
More on Tensors with Different Rank and Symmetric Rank. SIAM J. Matrix Anal. Appl. 45 (1) (2024)
Yaroslav Shitov
Linear mappings preserving the completely positive rank. Eur. J. Comb. 109 (2023)
Yaroslav Shitov
A sign pattern with all diagonal entries nonzero whose minimal rank realizations are not diagonalizable over ℂ. Discret. Math. 344 (1) (2021)
Yaroslav Shitov
Nonnegative rank depends on the field. Math. Program. 186 (1) (2021)
Yaroslav Shitov
The Waring Rank of the 3 x 3 Permanent. SIAM J. Appl. Algebra Geom. 5 (4) (2021)
Yaroslav Shitov
Factoring a band matrix over a semiring. Fuzzy Sets Syst. 382 (2020)
Yaroslav Shitov
Euclidean Distance Matrices and Separations in Communication Complexity Theory. Discret. Comput. Geom. 61 (3) (2019)
Yaroslav Shitov
An Improvement to a Recent Upper Bound for Synchronizing Words of Finite Automata. J. Autom. Lang. Comb. 24 (2-4) (2019)
Mateusz Michalek, Yaroslav Shitov
Quantum Version of Wielandt's Inequality Revisited. IEEE Trans. Inf. Theory 65 (8) (2019)
Yaroslav Shitov
A Counterexample to Comon's Conjecture. SIAM J. Appl. Algebra Geom. 2 (3) (2018)
Yaroslav Shitov
Matrices of Bounded Psd Rank are Easy to Detect. SIAM J. Optim. 28 (3) (2018)
Yaroslav Shitov
On the complexity of graph coloring with additional local conditions. Inf. Process. Lett. 135 (2018)
Yaroslav Shitov
The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions. SIAM Rev. 59 (4) (2017)
Nicolas Gillis, Yaroslav Shitov
Low-Rank Matrix Approximation in the Infinity Norm. CoRR (2017)
Yaroslav Shitov
On the complexity of failed zero forcing. Theor. Comput. Sci. 660 (2017)
Yaroslav Shitov
Column subset selection is NP-complete. CoRR (2017)
Yaroslav Shitov
The Complexity of Positive Semidefinite Matrix Factorization. SIAM J. Optim. 27 (3) (2017)
Yaroslav Shitov
A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length. Theor. Comput. Sci. 674 (2017)
Yaroslav Shitov
Coloring the Power Graph of a Semigroup. Graphs Comb. 33 (2) (2017)
Yaroslav Shitov
A short proof that NMF is NP-hard. CoRR (2016)
Yaroslav Shitov
The complexity of positive semidefinite matrix factorization. CoRR (2016)
Yaroslav Shitov
A matrix ring with commuting graph of maximal diameter. J. Comb. Theory, Ser. A 141 (2016)
Yaroslav Shitov
The Diameter of Chess Grows Exponentially. Am. Math. Mon. 123 (1) (2016)
Yaroslav Shitov
Tropical lower bounds for extended formulations. Math. Program. 153 (1) (2015)
Yaroslav Shitov
Mixtures of star trees and deficiency graphs. Eur. J. Comb. 44 (2015)
Yaroslav Shitov
How many Boolean polynomials are irreducible? Int. J. Algebra Comput. 24 (8) (2014)
Yaroslav Shitov
Sign patterns of rational matrices with large rank. Eur. J. Comb. 42 (2014)
Yaroslav Shitov
Detecting matrices of combinatorial rank three. J. Comb. Theory, Ser. A 126 (2014)
Yaroslav Shitov
An upper bound for nonnegative rank. J. Comb. Theory, Ser. A 122 (2014)
Yaroslav Shitov
On the complexity of Boolean matrix ranks. CoRR (2013)
Yaroslav Shitov
When do the r-by-r minors of a matrix form a tropical basis? J. Comb. Theory, Ser. A 120 (6) (2013)