Computational Complexity

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

Thursday, December 23, 2021

Complexity Year in Review 2021

›
The pandemic hampered many activities but research flourished with a number of great results in complexity. Result of the year goes to Local...
2 comments:
Friday, December 17, 2021

Fifty Years of P vs. NP and the Possibility of the Impossible

›
I have a new article Fifty Years of P vs. NP and the Possibility of the Impossible , to mark the anniversary of the 1971 publication of Stev...
6 comments:
Sunday, December 12, 2021

Did Lane Hemaspaandra invent the Fib numbers?

›
 (I abbreviate Fibonacci by Fib throughout. Lane Hemaspaandra helped me with this post.)  We all learned that Fib invented or discovered the...
2 comments:
Wednesday, December 08, 2021

Defending the Status Quo

›
When the Wall Street Journal's editorial board  and the New York Post endorse your efforts, that should ring warning bells. Several mem...
16 comments:
Sunday, December 05, 2021

Yes Virginia, there is a Santa Clause for Complexity Theorists, If you Only Believe

›
(Guest Post by Hunter Monroe) In this  guest post and  discussion paper , I present a remarkable set of structurally similar conjecture...
5 comments:
Wednesday, December 01, 2021

TheoretiCS: A New TCS Journal

›
Guest Post from Paul Beame on behalf of the TheoretiCS Foundation I am writing to let you know of the launch today of TheoretiCS , a new ful...
2 comments:
Sunday, November 28, 2021

Open: 4 colorability for graphs of bounded genus or bounded crossing number (has this been asked before?)

›
 I have  co-authored (with Nathan Hayes, Anthony Ostuni, Davin Park) an open problems column  on the topic of this post. It is  here . Let g...
Monday, November 22, 2021

Finding an element with nonadaptive questions

›
Suppose you have a non-empty subset S of {1,...N} and want to find an element of S. You can ask arbitrary questions of the form "Does S...
2 comments:
Wednesday, November 17, 2021

CS Slow to Change?

›
Back in March of 2019 I wrote I was also going to post about Yann LeCun's Facebook rant about stodgy CS departments but then Yann goes a...
2 comments:
Sunday, November 14, 2021

When did Computer Science Theory Get so Hard?

›
 I posted on  When did Math get so hard?  a commenter pointed out that one can also ask  When did Computer Science Theory Get so Hard? For t...
8 comments:
Thursday, November 11, 2021

20 Years of Algorithmic Game Theory

›
Twenty years ago DIMACS hosted a  Workshop on Computational Issues in Game Theory and Mechanism Design . This wasn't the very beginning ...
4 comments:
Sunday, November 07, 2021

Reflections on Trusting ``Trustlessness'' in the era of ``Crypto'' Blockchains (Guest Post)

›
  I trust Evangelos Georgiadis to do a guest post on Trust and Blockchain.  Today we have a guest post by Evangelos Georgiadis on Trust. It ...
Wednesday, November 03, 2021

A Complexity View of Machine Learning?

›
Complexity is at its best when it models new technologies so we can study it in a principled way. Quantum computing comes to mind as a good ...
6 comments:
Sunday, October 31, 2021

When did Math Get So Hard?

›
I have been on many Math PhD thesis defense's  as the Dean's Representative. This means I don't have to understand the work, ju...
13 comments:
Wednesday, October 27, 2021

Fall 2021 Jobs Post

›
We're in the midst of a great transformation in computing, one where data takes center stage and I predict this will start to have a lar...
5 comments:
Sunday, October 24, 2021

Squaring the circle is mentioned in a Gilbert and Sullivan comic Opera.

›
The problem of squaring the circle : Given a circle, construct (with straightedge and compass) a square with the same area. While browsing t...
2 comments:
Sunday, October 17, 2021

Is MATH Ready for P=NP? Is Alexandra Fahrenthold Ready for P=NP?

›
(This post was inspired by Harry Lewis emailing me about his granddaughter.) Harry Lewis's grand daughter Alexandra Fahrenthold (see bot...
18 comments:
Friday, October 15, 2021

A Young Person's Game?

›
When László Babai first announced his graph isomorphism in quasipolynomial time result, I wrote We think of theory as a young person's g...
6 comments:
Sunday, October 10, 2021

I have a book out on muffins (you prob already know that)

›
Lance : How come you haven't blogged on your muffin book? You've blogged about two books by Harry Lewis (see here  and  here ) one b...
3 comments:
Friday, October 08, 2021

C++ is for Cookie and That's Good Enough for Me

›
Potbelly, a local sandwich chain, made me an offer I couldn't refuse: change my password and earn a free (and quite tasty) oatmeal choco...
3 comments:
‹
›
Home
View web version
Powered by Blogger.