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
Last fall I wrote about the different focus on models and proofs in the Econ and CS theory communities. Today I'll focus on the purpose of a model and what makes...Lance From Computational Complexity | April 6, 2010 at 01:18 PM
I don't remember what prompted it but about a month ago I tweetedYour paper might appear on Arxiv or ECCC, be widely read and even well cited. But don't think that...Lance From Computational Complexity | April 5, 2010 at 12:52 PM
STOC conference and hotel registration now live. Early registration deadline is April 30th. Registration for Complexity and Electronic Commerce coming soon. You...Lance From Computational Complexity | April 2, 2010 at 10:55 AM
Three recent happenings made me think about the amount I travel.I hit the 50K club (Premier Executive) in United for the first time last year. At first I was excited...Lance From Computational Complexity | March 30, 2010 at 12:54 PM
I'm at Ohio State for the Combinatorics,
Groups, Algorithms, and Complexity Conference in honor of Laci Babai's
60th birthday. An incredible turn out with 74 talks...Lance From Computational Complexity | March 25, 2010 at 09:38 AM
It's spring break at Northwestern and as I write this Tuesday morning,
I'm on a plane from San Francisco to Denver on my way to Columbus,
Ohio. My kids have their...Lance From Computational Complexity | March 24, 2010 at 11:11 AM
My father Paul Fortnow passed away thirty years ago today. Five years ago I wrote about some of the lessons I learned from him. Suppose I could go contact him back...Lance From Computational Complexity | March 21, 2010 at 11:45 AM
With spring quarter arriving, I will take a break from book
writing on P v. NP and come back to blogging. I hit my goal of getting
past the point of no return (about...Lance From Computational Complexity | March 19, 2010 at 02:27 PM
The Snows of Maryland are keeping Bill away from this blog again. Here in Chicago we deal with snow (and even earthquakes) in stride--my kids still have yet toaccepted...Lance From Computational Complexity | February 10, 2010 at 02:58 PM
Sam Roweis, an NYU CS professor specializing in machine learning, took his own life last Tuesday night. Jennifer Linden and Maneesh Sahani set up a weblog to share...Lance From Computational Complexity | January 18, 2010 at 12:34 PM
We go all the way back to January for the paper of the year, Mark Braverman's Poly-logarithmic independence fools AC0 circuits. Runners up include the Moser-Tardos...Lance From Computational Complexity | December 28, 2009 at 12:33 PM
With the end of the fall quarter I will take a break from the blog for a few months. This is not another End, just a chance to move my creative juices in another...Lance From Computational Complexity | December 11, 2009 at 11:41 AM
After a talk on derandomization at Midwest Theory Day, someone asked if those techniques could also be used in quantum computing.
In classical randomness under ...Lance From Computational Complexity | December 8, 2009 at 04:05 PM
Quick announcement: If you are a student who wants to go to SODA but doesn't have the funds, click here.
I had forgotten we did this. Here's a video of my daughter...Lance From Computational Complexity | December 7, 2009 at 12:34 PM
Dean Foster asked me for a probability that P=NP. Now P=NP is not a probabilistic event, either P=NP or P?NP (if it's independent it's still equal or unequal in...Lance From Computational Complexity | December 4, 2009 at 12:26 PM
If Professor Alice at Faber College visits Dr. Bob at the University of Southern North Dakota, who should cover Alice's expenses? It depends on who does the asking...Lance From Computational Complexity | December 1, 2009 at 02:39 PM
First a message from David Johnson for proposals on locations for SODA 2012 both in and outside the US.
Here's an interesting approach to the birthday paradox...Lance From Computational Complexity | November 25, 2009 at 11:31 AM
Last Friday DIMACS celebrated its 20th anniversary. Muthu summarizes the event.
DIMACS has served the theoretical computer science community well over these two...Lance From Computational Complexity | November 24, 2009 at 02:04 PM
A student asked me which version of a research paper to cite, a journal (the last reviewed version) or a conference (the first reviewed version) of a paper. I generally...Lance From Computational Complexity | November 20, 2009 at 12:57 PM
As I tweeted yesterday, the videos of talks from the 2009 FOCS conference are now online. Thanks to FOCS PC chair Daniel Spielman and Georgia Tech's ARC Centercollected...Lance From Computational Complexity | November 18, 2009 at 11:43 AM