The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square
type: Item
instance of: scholarly article
title: The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square
zbMATH Open document ID: 1013.68268
DOI: 10.1016/S0925-7721(02)00047-0
author: Jin Akiyama
author: Gisaku Nakamura
author: Akihiro Nozaki
author: Ken'ichi Ozawa
author: Toshinori Sakai
published in: Computational Geometry
publication date: 2003-04-28T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1902828
zbMATH Keywords: sequentially \(n\)-divisible square
zbMATH Keywords: purely recursive dissection
MaRDI profile type: Publication
cites work: Q4547790
cites work: Simple perfect squared square of lowest order
cites work: Q4222032
Recommended article: Q4547790
Recommended article: Q5365047
Recommended article: A Master Theorem for Discrete Divide and Conquer Recurrences
Recommended article: Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
Recommended article: Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
Recommended article: Q5876021
Recommended article: Multidimensional Divide-and-Conquer Maximin Recurrences
Recommended article: A computational substantiation of the \(d\)-step approach to the number of distinct squares problem
Recommended article: Q4547791
Recommended article: Q4246498
description: scientific article; zbMATH DE number 1902828