# Blogroll

authorLance

From Computational Complexity

#### Half-Exponential No More

I've mentioned Kannan's proof that $$\Sigma_2^p$$ does not have $$n^2$$ size-circuits before. A similar proof shows that \(\Sigma_2^E = \mathrm{NTIME}^\mathrm{NP}...

From Computational Complexity

#### We Must Be Doing Something Right

The Chicago Tribune ran an editorial Monday that started What’s the best four-year college in Illinois? Not the University of Chicago, Northwestern University or...

From Computational Complexity

#### Mr. Jaeger and The Scroll

There were three major influencers in my educational journey: Mike Sipser, my PhD advisor at Berkeley and MIT, Juris Hartmanis who founded the field of computational...

From Computational Complexity

#### Books to Inspire Math

Two of my colleagues and co-authors from my early days at the University of Chicago have released books over the past few months designed to excite people withMathematical...

From Computational Complexity

#### What Makes a Constructive Proof?

In this weblog, we've used constructive in different ways. Often we talk about constructive as something we can create in polynomial time, like an expander. But...

From Computational Complexity

#### Transcripts for the 21st Century

When I start a new academic job, I need to prove that I actually have a PhD. I have to log in my MIT alumni page, pay my \$10 and they email my graduate transcript...

From Computational Complexity

#### Turning Sixty

I turn sixty today, spending my birthday reviewing a computer science department in Asia. Sixty is a good time to look back and reflect in a rambling way.I started...

From Computational Complexity

#### The Acting Professor

When I taught Programming for Engineers at Northwestern in 2008, the textbook gave access to PowerPoint slides I could use to teach the class. Since C++ is notseries...

From Computational Complexity

#### The College Visits

My wife's cousin and her daughter came and visited Chicago. The daughter, between junior and senior year of high school, is on the tail end of college tour season...

From Computational Complexity

#### Paper Writing Before Overleaf

A twitter question from a young researcher. Wait, how do paper writing collaborations work with LaTeX that doesn’t use overleaf? You need more than a .Tex file...

From Computational Complexity

#### More on Psuedodeterminism

Back in May I posted about a paper that finds primes pseudodeterministically and Quanta magazine recently published a story on the result. Oddly enough the paper...

From Computational Complexity

Twitter tells me it's my twitterversary, 15 years since I first started tweeting. Not sure I'll make it to sweet sixteen.No longer do tweets show up on this blog...

From Computational Complexity

#### Automating Mathematicians

The New York Times published an article with the ominous title A.I. Is Coming for Mathematics, Too. We know by the work of Gödel and Turing that we can't automate...

From Computational Complexity

#### Chernoff Turns 100

Guest post by Ravi BoppanaHerman Chernoff celebrates a milestone today: he turns 100 years old.  We in theoretical computer science know Professor Chernoff primarily...

From Computational Complexity

#### Don't Negotiate with Logic

Computer science and mathematicians often try to use logic to negotiate whether it be at a university or life in general. I've tried it myself and it doesn't usually...

From Computational Complexity

#### Randomized Acceptances

NeurIPS recently released their 2021 consistency report, a sequel to the 2014 experiment. While the conference has grown dramatically, the results remain "consistent"...

From Computational Complexity

#### Finding Primes Pseudodeterministically

In 2003, Agrawal, Kayal and Saxena showed that primality testing is in P, i.e., you could test for primes without using any randomness.What if you want to findposted...

From Computational Complexity

#### Community Guidelines that Ignore History

Last week I got the following email from Blogger:As you may know, our Community Guidelines (https://blogger.com/go/contentpolicy) describe the boundaries for what...

From Computational Complexity

#### Winter is Coming

I fear we are heading to a computer science winter. Now why would I say that when CS enrollments are at record levels and AI is driving incredible excitement in...

From Computational Complexity

#### Breaking Ground in Isomorphism Testing: A Leap Forward for a Bottleneck Case of Group Isomorphism

Guest post by Josh Grochow and Youming QiaoThere has, quietly, been somewhat of a breakthrough in isomorphism testing. No, not as big as Babai's 2016 Graph Isomorphism...