The optimality of a certain purely recursive dissection for a sequentially n-divisible square
From MaRDI portal
(Redirected from Publication:1869738)
The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square
The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square
Recommendations
- scientific article; zbMATH DE number 1786498
- A master theorem for discrete divide and conquer recurrences
- A master theorem for discrete divide and conquer recurrences
- Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
- Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
- scientific article; zbMATH DE number 7647200
- Multidimensional Divide-and-Conquer Maximin Recurrences
- A computational substantiation of the d-step approach to the number of distinct squares problem
- scientific article; zbMATH DE number 1786499
- scientific article; zbMATH DE number 1294372
Cites work
Cited in
(6)- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
- Exhaustive generation of `Mrs. Perkins's quilt' square dissections for low orders
- Hinged dissections exist
- scientific article; zbMATH DE number 1786498 (Why is no real title available?)
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
This page was built for publication: The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869738)
