Polynomial complexity recognizing a tropical linear variety
Dima Grigoriev
TL;DR
This paper presents a polynomial-time algorithm for determining whether a point lies within a specified tropical linear variety, advancing computational methods in tropical geometry.
Contribution
It introduces the first polynomial complexity algorithm for recognizing membership in tropical linear varieties.
Findings
Algorithm operates in polynomial time
Efficient membership testing for tropical linear varieties
Potential applications in tropical geometry computations
Abstract
A polynomial complexity algorithm is designed which tests whether a point belongs to a given tropical linear variety.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Coding theory and cryptography · Algebraic Geometry and Number Theory