Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Covering Regions by Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a manhattan path and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-hard polygon decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893361 / rank
 
Normal rank

Revision as of 08:36, 24 June 2024

scientific article
Language Label Description Also known as
English
Rectangular partition is polynomial in two dimensions but NP-complete in three
scientific article

    Statements

    Rectangular partition is polynomial in two dimensions but NP-complete in three (English)
    0 references
    0 references
    0 references
    1991
    0 references
    polygon decomposition
    0 references
    NP-complete
    0 references

    Identifiers