acm-header
Sign In

Communications of the ACM

Blogroll


bg-corner

From Computational Complexity

Long Tails and Fat Heads

Sometimes words or phrases are used in MATH and then spread to the REAL WORLD. I have blogged about how the terms Prisoner's Dilemma has become a real-world-phrase...

From Computational Complexity

Crystal Math- What NUMB3RS and BREAKING BAD both get wrong

The TV show Numb3rs  had as a premise that a GENIUS mathematician could help solve crimes. Is this true? I rather doubt you need a GENIUS- though of course some...

From Computational Complexity

STOC CFP still delayed- but I was asked to pass this along

Since there were comments on the blog about the STOC and CCC CFP not being out yet I mailed various people who are in-the-know. I got email from David Shmoys  (STOC...

From Computational Complexity

Did YOU think the NSA could factor fast?

Before the recent revelations about the NSA (see Lances Post and Scott's post )I would tell my class, when teaching P and NP, We have very good reasons to think...

From Computational Complexity

T/F - No Explanation needed VS T/F-Explanation needed.

One of the comments on my blog on Types of question for exams A True/False math question where they have to prove their answer. A student who picks the wrongall...

From Computational Complexity

Types of questions for exams

QUESTION: Give as many types of exam questions you can, give examples, and comment on if this is a good type of question. My answer below. A problem that some...

From Computational Complexity

What are Galois Games?

How are math concepts named? After the people who was involved with it. Examples: The Cook-Levin Theorem, Goldbach Conjecture, Ehrenfeucht-Fraisse games, Banach...

From Computational Complexity

When Lance was 10 years old..

In honor of Lance's 50th birthday I ask the following: When Lance was 10 years old which of the following were true? (Disclosure- some of the below are from a birthday...

From Computational Complexity

How much Trig does your governor know?

How much math should our public officials know? Basic probability and statistics so they can follow the arguments that their science advisers give them. And they...

From Computational Complexity

Longest time between posing a math problem and it being answered?

(We were asked to remind you: ITCS 2014 Call for papers: call for papers.) What problem in math had the longest time between POSING IT and SOLVING it? This might...

From Computational Complexity

Certifying primality in a CONSTANT number of operations

For this post I will only count the operations PLUS, MINUS, MULT. They may be done on rather large numbers. Recall that from the work coming out of Hilberts 10th...

From Computational Complexity

I gave a poster session at Erdos 100- so how did it go?

In a a prior post I suggested that STOC perhaps have people give posters instead of talks. While I doubt this will ever happen I think its worth thinking about,...

From Computational Complexity

A(nother) nice use of Gen Functions

In a prior post I tried to give a simple example of a proof that uses Gen Functions where there was no other way to do it. For better or worse, before I posted...

From Computational Complexity

DUMP YOUR TABLES! (the moral of my story that started with a hat problem)

Recall from my last post: PROBLEM 1: There are n people sitting on chairs in a row. Call them p1,...,pn. They will soon have HATS put on their heads, RED or BLUE...

From Computational Complexity

A problem and later a story and a point.

I have (1) a math problem to tell you about (though I suspect many readers already know it), (2) a story about it, and (3) a point to make. TODAY I'll just do the...

From Computational Complexity

Combinatorics use to not get any respect. But because of Erdos...

(This blog is based on things I heard at the Erdos 100th Bday Conference) I have spend the last week at the Erdos 100th bday conference. One point that was made...

From Computational Complexity

Quantum Tecniques/Gen Functions- don't be afraid of new techniques

Ronald de Wolf gave a GREAT talk at CCC on the uses of Quantum techniques to Classical Problems. He made the analogy of using the Prob Method to prove non-prob...

From Computational Complexity

Fraud or not ?

For each of these, are they frauds? The Turk was a chess playing ``computer'' (around 1770) that was later discovered to be cheating--- a human made the moves...

From Computational Complexity

STOC: Some NON-radical ideas

At the STOC business meeting Joan Feigenbaum (PC chair) raised some very good points. There was no real discussion (or perhaps the burning car was the discussion)...

From Computational Complexity

Do you KNOW how you KNOW what you KNOW? I don't KNOW.

When watching Jeopardy with Darling if I get a question correct that is NOT in my usual store of knowledge (that is NOT Ramsey Theory, NOT Vice Presidents, NOTHow...
Sign In for Full Access
» Forgot Password? » Create an ACM Web Account