From Schneier on Security
Artificial intelligence (AI) has been billed as the next frontier of humanity: the newly available expanse whose exploration
…
B. Schneier| February 29, 2024
Graph Theorist and Georgia Tech Math Professor Robin Thomas passed away Thursday after his long battle with ALS. He was one of the giants of the field and aHadwiger...Lance Fortnow From Computational Complexity | March 28, 2020 at 11:40 AM
First of all both the Turing award and Abel Prize announced yesterday.
As we start moving from the panic phase of the coronavirus to the boring phase, what kinds...Lance Fortnow From Computational Complexity | March 19, 2020 at 09:45 AM
People skip conferences because of the coronavirus or for global warming or just because conferences are too expensive and time consuming. I'm certainly no fanMarch...Lance Fortnow From Computational Complexity | March 12, 2020 at 09:17 AM
In 1890, Chicago South Side pastor Frank Gunsaulus gave a sermon where he said that with a million dollars he could build a school where students of all backgrounds...Lance Fortnow From Computational Complexity | March 5, 2020 at 09:35 AM
Guest post by Evangelos Georgiadis
Quite a few posts have recently focused on papers,publications and venues;
"optimal" venues for papers under different objective...Lance Fortnow From Computational Complexity | February 16, 2020 at 11:02 AM
Bill is out for blogging for a couple of weeks on injured-reserve (he’ll be fine). I put together a quick blog post on what’s happening in the world of publications...Lance Fortnow From Computational Complexity | January 23, 2020 at 06:22 PM
The Internets are buzzing about the new paper MIP* = RE by Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright and Henry Yuan. See posts by Scott, Boaz, not...Lance Fortnow From Computational Complexity | January 14, 2020 at 06:41 PM
Spoiler Alert: This post has details from the final episodes of the HBO television series Silicon Valley
A few times I've gotten emails from people claiming they...Lance Fortnow From Computational Complexity | January 8, 2020 at 08:35 PM
Some great theorems this year including non-deterministic double exponential time by quantumly entangled provers and integer multiplication in O(n log n) time.shockingly...Lance Fortnow From Computational Complexity | December 31, 2019 at 01:02 PM
So how do you parse the following paragraph from Monday's NYT Evening Breifing.
A study in JAMA Pediatrics this year found that the average Halloween resultedpaper...Lance Fortnow From Computational Complexity | October 31, 2019 at 02:46 PM
Starting PhD students over time would always assume that the computer science academic job market would be a strong or as weak when they graduate as it is whenCRA...Lance Fortnow From Computational Complexity | October 17, 2019 at 04:50 PM
By now you've probably heard the rumors of Google achieving quantum supremacy. I don't have inside information outside of Scott's blog post but it looks like the...Lance Fortnow From Computational Complexity | September 26, 2019 at 01:09 PM
You may have noticed, or not, that I haven't posted or tweeted much in the last month. I've had a busy time moving back to Chicago and starting my new positionsignificant...Lance Fortnow From Computational Complexity | September 5, 2019 at 12:03 PM
I've always felt a strong advisor/advisee relationship is the single most important factor in a successful PhD career. At its best, the advisor works closely with...Lance Fortnow From Computational Complexity | July 25, 2019 at 04:39 PM
Hao Huang's proof of the sensitivity conjecture that I posted on last week relied on a 1992 result of Gotsman and Linial. Let's talk about that result.
Consider...Lance Fortnow From Computational Complexity | July 11, 2019 at 01:54 PM
The blogosphere is blowing up over Hao Huang's just posted proof of the sensitivity conjecture, what was one of the more frustrating open questions in complexity...Lance Fortnow From Computational Complexity | July 2, 2019 at 01:05 PM
Georgia Tech FCRC Participants
I'm heading home from the 2019 ACM Federated Computing Research Conference in Phoenix, a collection of computer science meetings...Lance Fortnow From Computational Complexity | June 27, 2019 at 04:34 PM
Just a reminder that Grigory Yaroslavtsev has taken over the Theory Jobs Spreadsheet. Check out who is moving where and let everyone know where you will continue...Lance Fortnow From Computational Complexity | June 20, 2019 at 09:18 AM
This week finds me in Moscow for a pair of workshops, the Russian Workshop on Complexity and Model Theory and a workshop on Randomness, Information and Complexity...Lance Fortnow From Computational Complexity | June 12, 2019 at 12:27 PM
Twenty-five years ago Peter Shor presented a polynomial-time factoring algorithms for quantum computers. For Peter, it was a simple translation of a quantum algorithm...Lance Fortnow From Computational Complexity | June 6, 2019 at 10:46 AM