Rectangular spiral galaxies are still hard (Q2678258): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Towards an algorithmic guide to Spiral Galaxies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Planar 3DM is NP-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum-weight triangulation is NP-hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of Planar Counting Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138887 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Height-Preserving Transformations of Planar Graph Drawings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A better heuristic for orthogonal graph drawings / rank | |||
Normal rank |
Latest revision as of 07:09, 31 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rectangular spiral galaxies are still hard |
scientific article |
Statements
Rectangular spiral galaxies are still hard (English)
0 references
9 January 2023
0 references
pencil-and-paper puzzle
0 references
spiral galaxies
0 references
NP-completeness
0 references
non-crossing matching
0 references