Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:author |
gptkb:Larry_Stockmeyer
|
| gptkbp:complexity |
polynomial time
|
| gptkbp:field |
computer science
VLSI design |
| gptkbp:firstPublished |
1981
|
| gptkbp:input |
slicing tree
|
| gptkbp:namedAfter |
gptkb:Larry_Stockmeyer
|
| gptkbp:output |
minimum area floorplan
|
| gptkbp:publishedIn |
gptkb:SIAM_Journal_on_Computing
|
| gptkbp:solvedBy |
slicing floorplan problem
|
| gptkbp:usedFor |
floorplanning
rectangular dissection |
| gptkbp:bfsParent |
gptkb:Larry_Stockmeyer
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Stockmeyer algorithm
|