default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaroslav Shitov 0001
Person information
- affiliation: Moscow Institute of Physics and Technology, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Yaroslav N. Shitov:
Further $\exists {\mathbb {R}}$-Complete Problems with PSD Matrix Factorizations. Found. Comput. Math. 24(4): 1225-1248 (2024)- [j27]Yaroslav Shitov:
More on Tensors with Different Rank and Symmetric Rank. SIAM J. Matrix Anal. Appl. 45(1): 419-428 (2024) - 2023
- [j26]Yaroslav Shitov:
Linear mappings preserving the completely positive rank. Eur. J. Comb. 109: 103641 (2023) - 2022
- [j25]Yaroslav N. Shitov:
The Subrank of a Complex Symmetric Tensor Can Exceed its Symmetric Subrank. SIAM J. Appl. Algebra Geom. 6(4): 531-535 (2022) - 2021
- [j24]Yaroslav Shitov:
A sign pattern with all diagonal entries nonzero whose minimal rank realizations are not diagonalizable over ℂ. Discret. Math. 344(1): 112166 (2021) - [j23]Yaroslav Shitov:
Nonnegative rank depends on the field. Math. Program. 186(1): 479-486 (2021) - [j22]Yaroslav Shitov:
The Waring Rank of the 3 x 3 Permanent. SIAM J. Appl. Algebra Geom. 5(4): 701-714 (2021) - 2020
- [j21]Yaroslav Shitov
:
Factoring a band matrix over a semiring. Fuzzy Sets Syst. 382: 165-171 (2020)
2010 – 2019
- 2019
- [j20]Yaroslav Shitov:
Euclidean Distance Matrices and Separations in Communication Complexity Theory. Discret. Comput. Geom. 61(3): 653-660 (2019) - [j19]Yaroslav Shitov:
An Improvement to a Recent Upper Bound for Synchronizing Words of Finite Automata. J. Autom. Lang. Comb. 24(2-4): 367-373 (2019) - [j18]Mateusz Michalek, Yaroslav Shitov:
Quantum Version of Wielandt's Inequality Revisited. IEEE Trans. Inf. Theory 65(8): 5239-5242 (2019) - 2018
- [j17]Yaroslav Shitov:
On the complexity of graph coloring with additional local conditions. Inf. Process. Lett. 135: 92-94 (2018) - [j16]Yaroslav Shitov:
A Counterexample to Comon's Conjecture. SIAM J. Appl. Algebra Geom. 2(3): 428-443 (2018) - [j15]Yaroslav Shitov:
Matrices of Bounded Psd Rank are Easy to Detect. SIAM J. Optim. 28(3): 2067-2072 (2018) - 2017
- [j14]Yaroslav Shitov:
Coloring the Power Graph of a Semigroup. Graphs Comb. 33(2): 485-487 (2017) - [j13]Yaroslav Shitov:
The Complexity of Positive Semidefinite Matrix Factorization. SIAM J. Optim. 27(3): 1898-1909 (2017) - [j12]Yaroslav Shitov:
The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions. SIAM Rev. 59(4): 794-800 (2017) - [j11]Yaroslav Shitov:
On the complexity of failed zero forcing. Theor. Comput. Sci. 660: 102-104 (2017) - [j10]Yaroslav Shitov:
A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length. Theor. Comput. Sci. 674: 116-118 (2017) - [i5]Yaroslav Shitov:
Column subset selection is NP-complete. CoRR abs/1701.02764 (2017) - [i4]Nicolas Gillis, Yaroslav Shitov:
Low-Rank Matrix Approximation in the Infinity Norm. CoRR abs/1706.00078 (2017) - 2016
- [j9]Yaroslav Shitov:
A matrix ring with commuting graph of maximal diameter. J. Comb. Theory A 141: 127-135 (2016) - [j8]Yaroslav Shitov:
The Diameter of Chess Grows Exponentially. Am. Math. Mon. 123(1): 71-76 (2016) - [i3]Yaroslav Shitov:
A short proof that NMF is NP-hard. CoRR abs/1605.04000 (2016) - [i2]Yaroslav Shitov:
The complexity of positive semidefinite matrix factorization. CoRR abs/1606.09065 (2016) - 2015
- [j7]Yaroslav Shitov:
Mixtures of star trees and deficiency graphs. Eur. J. Comb. 44: 140-143 (2015) - [j6]Yaroslav Shitov:
Tropical lower bounds for extended formulations. Math. Program. 153(1): 67-74 (2015) - 2014
- [j5]Yaroslav Shitov:
Sign patterns of rational matrices with large rank. Eur. J. Comb. 42: 107-111 (2014) - [j4]Yaroslav Shitov:
How many Boolean polynomials are irreducible? Int. J. Algebra Comput. 24(8): 1183-1190 (2014) - [j3]Yaroslav Shitov:
An upper bound for nonnegative rank. J. Comb. Theory A 122: 126-132 (2014) - [j2]Yaroslav Shitov:
Detecting matrices of combinatorial rank three. J. Comb. Theory A 126: 166-176 (2014) - 2013
- [j1]Yaroslav Shitov:
When do the r-by-r minors of a matrix form a tropical basis? J. Comb. Theory A 120(6): 1166-1201 (2013) - [i1]Yaroslav Shitov:
On the complexity of Boolean matrix ranks. CoRR abs/1306.1114 (2013)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
