What is the museums floorplan design and who was the architect ?
More importantly , a number of NP - hard problems with floorplans have polynomial time algorithms when restricted to sliceable floorplans .