An algorithm to recover shredded random matrices
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 3458693 (Why is no real title available?)
- scientific article; zbMATH DE number 3544095 (Why is no real title available?)
- A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles
- A congruence theorem for trees
- Almost every graph has reconstruction number three
- Graph reconstruction -- some new developments
- Information Theory of DNA Shotgun Sequencing
- On a new digraph reconstruction conjecture
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- Random Graph Isomorphism
- Shotgun assembly of Erdős-Rényi random graphs
- Shotgun reconstruction in the hypercube
- The cycle structure of random permutations
- The graph reconstruction number
- Unique reconstruction threshold for random jigsaw puzzles
This page was built for publication: An algorithm to recover shredded random matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622734)