Fast deterministic algorithms for matrix completion problems

DOI10.1007/978-3-642-36694-9_32MaRDI QIDQ4911538zbMATH OpenOpenAlexFDO

Authors Tasuku Soma

Publication date 19 March 2013

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36694-9_32

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrix completion problems (15A83) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• Fast deterministic algorithms for matrix completion problems
• Deterministic polynomial time algorithms for matrix completion problems
• Deterministic network coding by matrix completion
• Maximum rank matrix completion
• Fast matrix rank algorithms and applications

Cited in

(6)

• Maximum rank matrix completion
• A divide-and-conquer algorithm for binary matrix completion
• Deterministic network coding by matrix completion
• Fast deterministic algorithms for matrix completion problems
• scientific article; zbMATH DE number 7306912 (Why is no real title available?)
• Deterministic polynomial time algorithms for matrix completion problems

This page was built for publication: Fast deterministic algorithms for matrix completion problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911538)