Abstract
In this note, we present two new algorithms for the Steinitz Exchange Lemma. They are grounded on a single application of a procedure (finding either a row echelon form or a basic minor) that has to be applied repeatedly in previously known algorithms. Proving correctness of both the algorithms, we obtain two new, direct proofs of the Exchange Lemma.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
