Pages that link to "Item:Q313771"

The following pages link to A computational substantiation of the \(d\)-step approach to the number of distinct squares problem (Q313771):

Displaying 3 items.

• A \(d\)-step approach to the maximum number of distinct squares and runs in strings (Q496539) (← links)
• Bannai et al. method proves the \(d\)-step conjecture for strings (Q516879) (← links)
• The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square (Q1869738) (← links)