Skip to main content
MathOverflow
LegionMammal978's user avatar
LegionMammal978's user avatar
LegionMammal978's user avatar
LegionMammal978
  • Member for 8 years, 1 month
  • Last seen more than a week ago
Profile Activity

22 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
comment
Is there a lower bound for the computational complexity of the traveling salesman problem?
@gnasher729 Polynomial is certainly a lower bound, though.
comment
Can squares of side 1/2, 1/3, 1/4, … be packed into three quarters of a unit square?
Perhaps this could also be due to an assumption in the paper earlier that width is considered smaller (i.e., $l\geq w$)?
1
2