acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

From Computational Complexity

17x17: Paper that solved it available!/A contest inspired by it!/NPC result inspired by it!

Three new 17×17 items: The paper (and some sequels) that SOLVED the 17×17 problem and the 17×18 problem are now available here. (I can't seem to link to the page...

From Computational Complexity

STOC 2012- workshop and honored talks

I went to an enjoyed STOC this year. Today I talk about the workshops and the papers that either won awards or seem to be in the running. I may blog on other...

From Computational Complexity

Meetings/Conferences/Workshops/Seminars- whats in a name?

In June 11-14 will be a new workshop: Algorithmic Frontiers. How many venues do we have for meetings? What the call themselves: Meetings (e.g., MATHFEST), Conferences...

From Computational Complexity

So THATS why the 17x17 challenge was so hard. Or maybe not.

On November 30, 2009 I posted the famous 17x17 challenge: (Paraphrase) Find a 4-coloring of the 17x17 grid that has no monochromatic rectangles. For $289.00.here...

From Computational Complexity

Is it well known that we need to redefine well known?

A LONG time (so long ago I was a guest poster, not a co-blogger) I posted about how calling things that are on You-Tube rare is odd since ITS ON YOU-TUBE! ANYONE...

From Computational Complexity

Hanan Samt wins Kanellakis Prize!

( Symposium on Turing in Princeton in about a month UMCP is doing a job search for a lecturer New York Area Theory Day ) The Paris Kanellakis Theory and...

From Computational Complexity

I left Push Down Automata out of my class and learned some things!

This semester in the Ugrad Course titled Elementary Theory of Computation (Syllabus: Reg Languages, CFLs, Computability Theory, P and NP) I decided to NOT teach...

From Computational Complexity

How important is the PROOF of Cooks theorem for my ugrad class?

I am teaching Automata theory this semester. The topics are basically (1) Regular Languages, (2) Context Free Languages, (3) Decidable, undecidable, and c.e. sets...

From Computational Complexity

I'll be on that list until the day I die. Or later.

How hard is it to get OFF of lists? Univ of MD at College Park (UMCP) Professor Carl Smith was an editor for JCSS before his death in 2004. I put together a...

From Computational Complexity

Guest post on Tom Cover by Yoav Freund

(Details on registration and student travel awards for the 2012 IEEE Conference on Computational Complexity in Porto available at here. New York Area Theory...

From Computational Complexity

Trick question or Stupid question?

April fool days Blogs or Columns may present an open problem as closed, present a closed problems as open, make us wonder if it's a joke or not, (Lance...

From Computational Complexity

"Math was a mistake- I made it too hard"

(REMINDER- IF you are a STUDENT who wants to GOTO STOC 2012 but needs money to go then you should GOTO the STOC 2012 homepage and click on Travel Support. Deadline...

From Computational Complexity

What is an Elegant Proof?

What is an elegant proof? I do not know and I doubt it can be well defined; however, we all know it when we see it. I welcome comments on the topic; however, Ihere...

From Computational Complexity

Judea Pearl wins Turing Award

(In this age of lightenting fast communication I suspect you all already know that Judea Pearl won the Turing Award. Even so, it is worth posting about.) Judea...

From Computational Complexity

How do legit fields of knowledge decide between competing fields? How does Astrology?

Euler was born April 15, 1707. Hence by the Western Astrology that we all ignore he is an Aries. However, I recently heard about another way (also worth ignoring)...

From Computational Complexity

When a+b is harder than b+a

Is 1+4 a harder calculation than 4+1? It may be if you are 2+3 years old. I asked my 7-2 year old great niece Noelle the following sequence of questions. I include...

From Computational Complexity

The Erdos- de Bruijn theorem

The mathematician Nicolaas Govert de Bruijn passed away on Feb 17, 2012. The number of things named after him is quite large. I will discuss the Erdos-de Bruijn...

From Computational Complexity

Presidents Day Poll- what does the youth of american think about....

(In honor of President's day which was two days ago.) On Presidents Day last year I had my classes fill out a form saying who they thought was the best, second...

From Computational Complexity

People solve math problems for the prize money! NOT!

Why do people or organizations offer Prize Money for mathematics? Paul Erdos: He offered money to solve problems that he found interesting. I assume he wanted...

From Computational Complexity

STOC 2012 accepts are posted

STOC 2012 paper accepts are posted here. Travel support for grad students (which I am involved with) is posted here. On a quick glance: I tried counting thehere...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account