Jan B. Zernisch

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
2 √ 3 × √ 2 rectangle can be found in linear time, which yields an O(n logn) time algorithm for the general case. With a restriction to finite unit families, the former statement has been published by D. J. Kleitman and M. Krieger, who – as they state themselves – only provide “a general discussion of the methods used [throughout the proof] and an outline(More)
  • 1