Computational Complexity

Computational Complexity and other fun stuff in math and computer science from Lance Fortnow and Bill Gasarch

Thursday, February 28, 2013

Our Government at Work

›
Barring a surprise deal, the sequester goes into effect tomorrow. NSF Director (and soon to be CMU President) Subra Suresh announced a seque...
3 comments:
Tuesday, February 26, 2013

Enos, Oona, sqrt(3), and Aaronson

›
My darling does crossword puzzles and sometimes asks my help: Darling: Bill, Slaughter in Cooperstown - whats the answer? Bill: Enos. ...
7 comments:
Thursday, February 21, 2013

Interruptions

›
I got a new toy this week, the Pebble watch which I got early because I pre-ordered  donated to their Kickstarter campaign. It's a li...
1 comment:
Tuesday, February 19, 2013

Are most lower bounds really upper bounds?

›
Recently Daniel Apon (grad student of Jon Katz at UMCP, but he also hangs out with me) proved a LOWER BOUND by proving an UPPER BOUND. His p...
14 comments:
Friday, February 15, 2013

Beauty and Science

›
Christopher Shea wrote a recent Chronicle Review article Is Scientific Truth Always Beautiful?  I would argue the answer is yes, and it boil...
11 comments:
Wednesday, February 13, 2013

The Complexity-STOC Bonanza

›
STOC  and Complexity are co-located June 1-7 in beautiful Palo Alto, California. Both conferences have just announced their accepted papers...
2 comments:
Tuesday, February 12, 2013

Proving DFA-langs closed under concat and * without using equiv to NDFA's

›
While teaching the Equiv of DFA, NDFA, Reg exps, I wanted to impress upon my students that the best way to show DFA-langs are closed under c...
16 comments:
Thursday, February 07, 2013

Postdocs in Computer Science

›
Anita Jones is troubled by the growing number of postdocs in computer science, she uses "troubling" twice in the first paragraph o...
14 comments:
Tuesday, February 05, 2013

The (il)logic of fandom

›
(UMCP is having an REU (Research Experience for Undergradutes) this summer on Combinatorial Algorithms Applied Research . If you are an ugra...
6 comments:
Thursday, January 31, 2013

Who do you write papers for?

›
Mitch Daniels, the former governor of Indiana and new president of Purdue, wrote an inaugural letter  where he discusses many of the challen...
22 comments:
Tuesday, January 29, 2013

TCS online series- could this work?

›
Oded Regev, Anindya De and Thomas Vidick we are about to start an online TCS seminar series. See here for details, though I have the firs...
3 comments:
Thursday, January 24, 2013

The End of a Useless Test

›
First a word from our sponsor: Mihalis Yannakakis is celebrating his 60th birthday this year and you are invited to the party . From the E...
20 comments:
Tuesday, January 22, 2013

A New application of Ramsey Theory to a Geometry problem

›
All of the material summazized here is in a new paper by Gasarch and Zbarsky. You can find that paper here ) Consider the following proble...
6 comments:
Thursday, January 17, 2013

Rise of the Engineer

›
I rarely watch TV commercials anymore but its NFL playoff time and during a game last weekend, the Ford commercial showing how a liftgate ca...
5 comments:
Monday, January 14, 2013

paperfree?- we are not there yet

›
Last time I taught I had to decide if I would HAND OUT the HW or just say its posted (NOTE- I post it in any case.) This may seem old fash...
15 comments:
Thursday, January 10, 2013

Slow Science

›
You likely have not heard about the Slow Science manifesto . They don't blog. They don't tweet. They give a broken link to their Fac...
6 comments:
Monday, January 07, 2013

Do daughtered candidates to better- Look at the Data!

›
Someone in my election night party predicted Obama because: Ever since women got the right to vote (1920) if one candidate has a daughter a...
5 comments:
Wednesday, January 02, 2013

Erdős and Turing

›
Only nine months separate the births of two very influential mathematicians, Paul Erdős and Alan Turing, whose centenaries we celebrate this...
6 comments:
Thursday, December 27, 2012

2012 Complexity Year in Review

›
As we turn our thoughts from Turing to Erdős , a look back at the complexity year that was. Written with help from co-blogger Bill Gasarch....
8 comments:
Thursday, December 20, 2012

Flash Fill

›
Sometimes it just takes a simple new feature in a popular piece of software to remind us how computer science just does cool stuff. Excel ...
3 comments:
‹
›
Home
View web version
Powered by Blogger.