Pages that link to "Item:Q808703"

The following pages link to Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703):

Displaying 3 items.

• Formulas for the number of \((n-2)\)-gaps of binary objects in arbitrary dimension (Q1003705) (← links)
• 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
• Minimum convex partition of a polygon with holes by cuts in given directions (Q6487451) (← links)