acm-header
Sign In

Communications of the ACM

Blogroll


Refine your search:
datePast Week
authorGASARCH
bg-corner

From Computational Complexity

For what d is the following true: For all 2-colorings of \(R^d\) has a mono unit square (Answering(?) the Question)

 In my last post (see here) I invited you to work on the following question:Find a \(d\) such that--There is a 2-coloring of \(R^d\) with no mono unit square.--For...

From Computational Complexity

For what d is the following true: for all 2-colorings of \(R^d\) there is a mono unit square (Asking the Question)

 In this post I give a question for you to think about. My next post will have the answer and the proof. 1) The following are known and I have a set of slides about...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account