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
In Yesterday's post you were told about Susan:
Susan is 31 years old, single, outspoken and very
bright. She majored in philosophy. As a student she
was deeply...GASARCH From Computational Complexity | January 10, 2012 at 04:05 PM
Readers- I want you to answer this question and post your answers
as comments. I will tell you WHY I am asking tommorow.
Susan is 28 years old, single, outspoken...GASARCH From Computational Complexity | January 9, 2012 at 01:04 PM
(I have already posted this question on CS Theory Stack Exchange.)
If you know that 3-COL is NPC then you can prove that PLANAR 3-COL
is NPC by a NICE gadget...GASARCH From Computational Complexity | January 3, 2012 at 04:40 PM
How are Mitt Romney and Scott Aaronson similar? Different?
Similarities:
Both live in Massachusetts. Actually, Scott lives there but its not clear where Mitt...GASARCH From Computational Complexity | December 19, 2011 at 03:09 PM
In my last blog I asked you to look at this problem, try to solve it,
and tell me if you think it is too hard for a HS competition.
(I meant to post this on WED...GASARCH From Computational Complexity | December 14, 2011 at 05:13 AM
The Univ of MD HS Math Competition has two parts.
Part I is 25 multiple choice questions in 2 hours
(4 points for a correct answer, -2 for an incorrect answer)....GASARCH From Computational Complexity | December 12, 2011 at 02:13 PM
The recent discussion on Matrix Mult inspires the general
question of WHAT IS A BREAKTHROUGH?
Last year I tried to get an intelligent
discussion on this topic but...GASARCH From Computational Complexity | December 7, 2011 at 03:22 PM
(Guest post by Ryan O'Donnell)
Lance and Bill have graciously let me plug my recently begun book/blog
project, analysis of boolean functions.
I am writingBoolean...GASARCH From Computational Complexity | December 2, 2011 at 04:40 PM
(INNOVATIONS CONFERENCE:
here)
(While preparing this two other bloggers wrote on the same topic,
Scott here
and Lipton/Regan
here.
Our slogan: Complexity Blog...GASARCH From Computational Complexity | November 30, 2011 at 08:17 PM
Consider the following email I got:
Dear Professor,
1. Antarctica Journal of Mathematics
2. ArchimedesJournal of Mathematics
3. BesselJournal of Mathematics...GASARCH From Computational Complexity | November 16, 2011 at 03:41 PM
A while back GASARCH
solicited responses to a P vs NP poll
and gave Oct 31 as the deadline. Now that the deadline is passed
I post my answers.
Does P=NP? IIf...GASARCH From Computational Complexity | November 11, 2011 at 06:23 PM
Mission Impossible
was my favorite show as a kid. As an adult it would not make my
top 20, and I wonder why I liked it so much as a kid.
(Actually I do know- at...GASARCH From Computational Complexity | October 19, 2011 at 02:24 PM
A more nuanced view of Steve Jobs:
here.
A less nuanced view of Steve Jobs:
here.
The next Steve Jobs:
here
A very nice NON-Steve Jobs post
here.
Is thisAndrew...GASARCH From Computational Complexity | October 12, 2011 at 05:23 PM
What do you do if you read a paper or book and find mistakes in it?
My first impulse is to say:
Email the author. Always be polite and admit (which is true) that...GASARCH From Computational Complexity | October 5, 2011 at 05:56 PM
In a
prior post
I wrote that the Erdos-Turan Conjecture
should be a Millennium problem.
Today I am going to (1) suggest a generalization of the Erdos-Turan Conjecture...GASARCH From Computational Complexity | September 28, 2011 at 02:47 PM
(Joint post by Bill Gasarch and Daniel Apon)
Recently I (Daniel) reviewed Dexter Kozen's
Theory of Computation (it was AWESOME).
You can find the review
here...GASARCH From Computational Complexity | September 21, 2011 at 02:01 PM
Why is
a1/2 = sqrt(a)?
true?
To make the rule
ax+y=ax a y
work out.
Why is
(∀ x ∈ ∅)[P(x)]
true?
To make the rule
(∀ x ∈ A ∪ B)[P(x)] iff (∀ x ∈ A)[P(x)]...GASARCH From Computational Complexity | September 14, 2011 at 02:12 PM
(Samir Khuller Guest Post.)
On Conference Locations:
I recently looked at Orbitz for fares to Japan for SODA 2012 in Jan. The
round trip fare from DC to...GASARCH From Computational Complexity | September 9, 2011 at 05:46 PM
When I posted on sequence problems
here
some people said that they did not have unique answers.
Many problems FORMALLY do not have a unique answer, but common sense...GASARCH From Computational Complexity | September 7, 2011 at 11:58 PM
(FOCS registration is open:
here.
Note that there are tutorials on Sat Oct 22 and the conference talks are
Sun Oct 23-Tues Oct 25.)
(Guest post by By Jeffery...GASARCH From Computational Complexity | September 6, 2011 at 02:29 PM