Can one use a comic book and a toy to teach a complicated subfield of mathematics? Why knot? -- Posted by Lance to My Computational Complexity Web Log at...
314
Lance
fortnow
Oct 7, 2004 1:33 pm
In the US the terms Assistant Professor , Associate Professor and Professor represent different stages in one's career but they all play a similar role in...
315
Lance
fortnow
Oct 8, 2004 12:36 am
My nine-year old daughter had a homework problem with the following diagram. She had no problem solving questions like: Beginning and ending at the entrance,...
316
Lance
fortnow
Oct 8, 2004 12:36 am
My nine-year old daughter had a homework problem with the following diagram. She had no problem solving questions like: Beginning and ending at the entrance,...
317
Lance
fortnow
Oct 8, 2004 12:36 am
My nine-year old daughter had a homework problem with the following diagram. She had no problem solving questions like: Beginning and ending at the entrance,...
318
Lance
fortnow
Oct 8, 2004 12:36 am
My nine-year old daughter had a homework problem with the following diagram. She had no problem solving questions like: Beginning and ending at the entrance,...
319
Lance
fortnow
Oct 11, 2004 5:25 am
A report from Varsha Dani. The Grace Hopper Celebration of Women in Computing was held in Chicago on October 6-9. This was the fifth such conference, since its...
320
Lance
fortnow
Oct 11, 2004 9:06 pm
A report from Varsha Dani. The Grace Hopper Celebration of Women in Computing was held in Chicago on October 6-9. This was the fifth such conference, since its...
321
Lance
fortnow
Oct 12, 2004 6:15 am
I'm back in Dagstuhl for the workshop on Algebraic Methods in Computational Complexity . The roof looks great. I have attended several Dagstuhl workshops for ...
322
Lance
fortnow
Oct 13, 2004 3:53 pm
Dagstuhl was designed as a place to bring a small group of researchers to an isolated environment where they could give some talks, discuss research and...
323
Lance
fortnow
Oct 16, 2004 12:06 pm
At Dagstuhl Manindra Agrawal presented recent work of his students Neeraj Kayal and Nitin Saxena (the trio that showed a polynomial-time algorithm for...
324
Lance
fortnow
Oct 18, 2004 11:47 am
Adam Klivans reports from Rome. Rome is the host city for this year's FOCS conference . While everyone enjoys visiting one of the world's great capitals,...
325
Lance
fortnow
Oct 19, 2004 11:45 am
Fair and balanced coverage from Adam Klivans To answer one of Lance's previous posts , the Internet is definitely harming conferences: most everyone who stayed...
326
Lance
fortnow
Oct 20, 2004 6:03 pm
A guest post from William Gasarch Why is it hard for us to explain to the layperson what we do? The following true story is telling. I will label the...
327
Lance
fortnow
Oct 21, 2004 6:40 am
A guest post from William Gasarch Why is it hard for us to explain to the layperson what we do? The following true story is telling. I will label the...
328
Lance
fortnow
Oct 21, 2004 11:13 pm
Saturday Evening, October 25, 1986: I huddled with about a dozen of my fellow MIT graduate students (and a couple of faculty) watching game six of the baseball...
329
Lance
fortnow
Oct 23, 2004 12:12 pm
September Edition Computation Complexity and Computational Learning share many aspects and goals. We both analyze and compare different models of computation ...
330
Lance
fortnow
Oct 25, 2004 5:28 pm
In Bill Gasarch's post last week, he discusses what makes a problem natural. You used to hear the argument that a complexity class was natural if it contained...
331
Lance
fortnow
Oct 25, 2004 7:12 pm
In Bill Gasarch's post last week, he discusses what makes a problem natural. You used to hear the argument that a complexity class was natural if it contained...
332
Lance
fortnow
Oct 26, 2004 4:28 pm
Some upcoming deadlines: STOC (11/4), Complexity (11/18), Electronic Commerce (12/7), the new NSF program Theoretical Foundations (1/5), and ICALP (2/13). Feel...
333
Lance
fortnow
Oct 28, 2004 11:35 am
-- Posted by Lance to My Computational Complexity Web Log at 10/28/2004 06:34:57 AM...
334
Lance
fortnow
Oct 29, 2004 1:44 pm
In theoretical computer science we traditionally list the co-authors of our papers alphabetically. Done this way for "fairness"; it leads to a binary notion of...
335
Lance
fortnow
Oct 31, 2004 11:46 pm
A true story on Election Day 2000: An Israeli postdoc in the US came to work and said "I have watched the conventions and seen the debates. I have studied the...
336
Lance
fortnow
Nov 2, 2004 4:21 pm
Complexity theorists have an important choice to make this week. That's right, I'm talking about whether to send your papers to STOC or Complexity . So let me...
337
Lance
fortnow
Nov 4, 2004 1:38 am
Our department, like many other academic departments, felt a strong sense of depression today. Just remember there are still theorems to prove, papers to...
338
Lance
fortnow
Nov 4, 2004 1:38 am
Our department, like most other academic departments, felt a strong sense of depression today. Just remember there are still theorems to prove, papers to...
339
Lance
fortnow
Nov 5, 2004 3:17 pm
From Paquet via Nielsen comes an idea of publicly posting referee reports. Let's kill this idea quickly. A review of the usual referee process: The...
340
Lance
fortnow
Nov 8, 2004 3:31 pm
October Edition Alice and Bob have subsets of {1,,n}. How much communication do Alice and Bob need to determine if their subsets have a empty intersection. In...
341
Lance
fortnow
Nov 9, 2004 9:01 pm
A grad student asked me how we managed before the internet specifically in relation to submitting to conferences? I cannot completely answer that question as I...
342
Lance
fortnow
Nov 10, 2004 10:06 pm
Omer Reingold has shown Undirected s-t Connectivity in Deterministic Log-Space . This settles a long-standing open question for a problem previously known to...
