Pick Up Sticks
Larry Shepp, Doron Zeilberger, and Cun-Hui Zhang
TL;DR
This paper applies a well-known theoretical computer science result to address a challenging problem, providing an elegant and concise proof for part of the solution.
Contribution
It offers a novel, simplified proof of a significant theoretical result related to the problem.
Findings
Provided a quick proof of half of the problem
Demonstrated the applicability of classic results to new problems
Simplified understanding of the theoretical approach
Abstract
We apply a classic result in Theoretical Computer Science to solve a sticky problem, and give a neat and slick quick proof of half of it
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
TopicsGenome Rearrangement Algorithms · Complexity and Algorithms in Graphs · Algorithms and Data Compression