Mathematics – Combinatorics
Scientific paper
2005-03-02
Mathematics
Combinatorics
Replacement is to fill a gap in the proof of Theorem 3.1
Scientific paper
We show that determining Kapranov rank of tropical matrices is not only NP-hard over any infinite field but also if solving Diophantine equations over the rational numbers is undecidable, then determining Kapranov rank over the rational numbers is undecidable. We prove that Kapranov rank of tropical matrices is not bounded in terms of tropical rank, answering a question of Develin, Santos, and Sturmfels.
Kim Kyung Hyuk
Roush Fred W.
No associations
LandOfFree
Kapranov rank vs. tropical rank does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Kapranov rank vs. tropical rank, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kapranov rank vs. tropical rank will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-284193