tag:blogger.com,1999:blog-37222332008-11-19T02:29:30.302-06:00Computational complexity and other fun stuff in math and computer science as viewed by Lance Fortnow and Bill Gasarch.Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.comBlogger1287125tag:blogger.com,1999:blog-3722233.post-4358581875046106992008-11-18T06:00:00.002-06:002008-11-18T06:03:32.179-06:00One of my crypto students pointed me to the &quot;Nerdcore Hip-Hop&quot; group MC Frontalot. Here's a <a href="http://www.youtube.com/watch?v=z8rqdEahBos">trailer</a> for their tribute film, <a href="http://www.nerdcorerisingthemovie.com/">Nerdcore Rising</a>. <p> <object width="425" height="344"><param name="movie" value="http://www.youtube.com/v/z8rqdEahBos&hl=en&fs=1"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="always"></param><embed src="http://www.youtube.com/v/z8rqdEahBos&hl=en&fs=1" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" width="425" height="344"></embed></object> <p> You can download their song <a href="http://frontalot.com/media.php/325/MC_Frontalot_SFTF_%2801%29_Secrets_From_The_Future.mp3">Secrets from the Future</a> that makes a good point about the life of crypto. From the (slightly explicit) <a href="http://frontalot.com/index.php/?page=lyrics&lyricid=41">lyrics</a> <blockquote> Best of all, your secret: nothing extant could extract it.<br> By 2025 a children's Speak & Spell could crack it. <p> You can't hide secrets from the future with math.<br> You can try, but I bet that in the future they laugh<br> at the half-a**ed schemes and algorithms amassed<br> to enforce cryptographs in the past. </blockquote> I don't expect a general way to break RSA or factor numbers either on classical machines (for lack of algorithms) or quantum machines (for lack of controlled entanglement) in the next couple of decades. Nevertheless you can't count on say a 1024 or 2048 bit RSA key being safe in a decade or two. Better algorithms combined with faster highly parallelized machines may break those codes. Or maybe they won't&mdash;but you can't be sure. <p> Even the NSA gives expiration dates on encrypted data. If you used 100,000 bit keys your secrets should survive into the next century. But you have to wonder&mdash;how dark are your secrets that you need them to last?Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com0tag:blogger.com,1999:blog-3722233.post-49514207872065393602008-11-17T12:16:00.000-06:002008-11-17T12:17:03.958-06:00In the excellent paper <a href="http://www.math.tau.ac.il/~nogaa/PDFS/publications.html"> On the power of two, three, and four probes </a> <blockquote> <i>It is well known that every graph with s vertices and at least 2s edges contains a cycle of length at most 2log s</i> </blockquote> My students puzzled over this one in two ways. (1) How to prove it? Two of them came up with correct proofs that were not that hard. (2) Is it really well known? Two of them searched the web for a proof. They could not find one. <br><br> The problem with the phrase <i>It is well known that</i> is that it may be well known to people who know it (duh) but not to others. People not in the know don't even know if its hard or not (its not). Perhaps they should have said <i>It is easy to show that</i>. Or give a hint to the proof. <br><br> I invite my readers to give proofs to see if they differ from my students, and also so that the next time someone needs to reference this, they can point to this blog and attibute it to some cute alias. <br><br> A student asked me if giving as a reference a blog site or an unpublished paper on line is legit. I would say its <i>more</i> legit then giving as a reference a paper that is not on-line. A paper that is refereed but not online had a few people look at it closely. A paper that is unrefereed but online might have a lot more people look at it (then again, it might not). But since the reader can access it, he or she might be able to tell for himself or herself whether the statement they need has been proven properly.GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com10tag:blogger.com,1999:blog-3722233.post-30262203264415615272008-11-14T13:51:00.001-06:002008-11-14T13:52:34.048-06:00Sometimes the literature gives a proof, and then a reference, but the reference is not really to that proof. Here is an example. The theorem in question is the following: <blockquote> For any seq of n²+1 distinct reals there is either a dec subseq of length n or an inc subseq of length n+1. </blockquote> In <a href = "http://www.amazon.com/Proofs-BOOK-Martin-Aigner/dp/3540404600/ref=pd_bbs_sr_1?ie=UTF8&s=books&qid=1216226882&sr=8-1">Proofs from the book</a> the authors attribute the following argument to <a href = "http://www.cs.umd.edu/~gasarch/BLOGPAPERS/erdos-szekeres.pdf">Erdos-Szekeres</a> (paraphrased): <blockquote> Let the seq be a(1),...,a(n²+1). Associate to each a(i) the number t(i) which is the length of a <i>longest inc subseq</i> starting at a(i). If there is an i such that t(i) &ge n+1 then we are done. If not then the function mapping a(i) to t(i) maps a set of size n²+1 to a set of size n. Hence there is some s such that n+1 elements of the seq map to s. These n+1 elements form a dec seq. </blockquote> The actual proof in the Erdos-Szekeres paper is this (paraphased): <blockquote> Let f(n) be the minimum number of points out of which we can select n inc or dec subseq. We show f(n+1) = f(n)+2n-1. Let a(1),...,a(f(n)+2n-1) be a sequence of distinct reals. Out of the first f(n) of them there is an inc or dec subseq of length n. Call the last elements of that subseq b(1). Remove it. (There is now a seq of length f(n)+2n-2.) Repeat the process to obtain b(1), b(2), ..., b(2n). Let A be the b(i)'s that are from inc subseq. Let B be the b(i)'s that are from dec subseq. It is easy to show that A is itself a dec subseq and that B is itself an inc subseq. If A or B has n+1 elements then we are done. The only case left is that A and B each have n elements. Let a be the last element in A and b be the last element in b. It is easy to show that a=b. But one of them was removed before the other, so this is impossible. </blockquote> Thoughts: <ol> <li> I suspect that in talks Erdos gave he did the proof now atributed to Erdos-Szekeres and hence people naturally assumed that this is the paper it was in. <li> I am surprised that <i>Proofs from the book</i> gave this proof. There is, IMHO, a better proof. I do not know whose it is. <blockquote> Let the seq be a(1),...,a(n²+1). Map every 1 \le i \le n²+1 to (x,y) where x (y) is the length of the longest inc (dec) subseq than ends with a(i). It is easy to show that this map is 1-1. If all of the x,y that are mapped to are in [n]x[n] then the domain is bigger than the range, contradiction. </blockquote> <li> Erdos-Szekeres first proved this theorem in 1935. Martin and Joseph Kruskal proved it 15 years later without knowing that Erdos-Szekeres had proven it; though by the time Joesph Kruskal published it he knew. I have gathered up 5 proofs of the theorem that I know <a href="http://www.cs.umd.edu/~gasarch/BLOGPAPERS/subseq4proofs.pdf">here</a>. <li> In those days it was <i>harder</i> to find out if someone else had done what you had done since they didn't have google, but it may have (in some cases) been <i>easier</i> since there were so many fewer researchers- you could just call them. OH- but long distance was expensive back then. </ol>GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com9tag:blogger.com,1999:blog-3722233.post-66897050235579772392008-11-13T06:13:00.001-06:002008-11-13T06:15:02.407-06:00My younger daughter was deeply moved by <a href="http://www.climatecrisis.net/">An Inconvenient Truth</a> and has become a staunch environmentalist ever since. She pushed me to change our lightbulbs as well as get a hybrid car as my next car. I usually don't let my kids influence our major purchase decisions but it's hard to argue with them when they're right. <p> So I got a Toyota Camry Hybrid about two weeks ago. When I ordered the car back in September I calculated I would make up the extra cost in about four years, but that was back when gas was $4/gallon and before Toyota slashed prices on their non-hybrid Camrys. I was told I had a 4-6 month wait but I picked up one sooner that someone else backed off of, probably because of the economy. <p> I certainly get good gas mileage&mdash;I've driven 250 miles and still have half of my original tank. But I do notice several features that simply exist to make me feel good about getting a hybrid. Most cars have tank sizes so the car goes about 300 miles on a tank. They kept the large tank size in this car so I can better feel the gas mileage. There is an MPG dial next to the speedometer, a fancy display showing arrows as energy gets transferred between the gas tank, engine and batteries and when I turn the car off it gives me an &quot;Excellent&quot; when I had good gas mileage. I wonder what I do wrong when I don't get the Excellent. <p> The neatest feature has nothing to do with being a hybrid. I never have to take the keys out of my pocket instead the car just senses them. The doors and the trunk just automatically unlock when I open them and I just press a key to start the car. All keys should work this way. <p> What's missing in cars these days is active Internet connectivity. I can easily think of many uses: Updates to maps, traffic, weather, local information, music streaming and VOIP. I'm sure there are many more possibilities people will come up with once a system is in place. <p> Oddly enough this will probably be my last hybrid, my next car will run solely on batteries or some other technology. That's life in the fast lane.Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com6tag:blogger.com,1999:blog-3722233.post-52796559183967701242008-11-12T10:05:00.001-06:002008-11-12T10:07:33.246-06:00Recently the Kakeya Conjecture over finite fields (henceforth <i>Kakeya</i>) was resolved. For information on what Kakeya is and how it was solved see Dvir's paper <a href ="http://www.math.ias.edu/%7edvir/papers/lop.html">On the size of Kakey Sets over Finite Fields</a> that solved it or a nice entry on <a href ="http://terrytao.wordpress.com/2008/03/24/dvirs-proof-of-the-finite-field-kakeya-conjecture/?referer=sphere_related_content/">Terry Tao's blog</a>. Some Applications of the techniques are in the paper by Dvir and Wigderson <a href ="http://www.math.ias.edu/%7edvir/papers/lop.html"> Kakeya Sets, new mergers and old extractors</a>. <br> <br> Fields Medal Winner Terry Tao and others worked on Kakeya. There were partial results with difficult proofs. But the final proof was easy to understand. This does NOT mean it was easy to generate- we all suspect verifying is easier than generation. How easy was the proof to understand? So easy that I saw and understood a talk on it in seminar and was able to reconstruct it while proctoring an exam. <br> <br> Whenever I see a math problem solved in a way that is easy but had been missed I wonder: is there an easy solution to P vs NP that is eluding us? <ol> <li> Kakeya <i>did not</i> have a community of people working on it. Even though the people working on it were brilliant there were not that many of them. To solve a math problem may require a diversity of viewpoints. P vs NP has alot of people <i>interested</i> in it. Are they <i>working</i> on it? Do they have a <i>diversity</i> of viewpoints? I honestly don't know. <li> There had been partial results on Kakeya. Hence there was hope. At this time there has been very little progress on P vs NP. (I would welcome counterarguments to this.) <li> There were no results saying <i>such-and-such technique cannot be used to solve Kakeya</i>. For P vs NP there are several such results: oracles, natural proofs, algebraization. (hmmm- is having three results really having several results?). Is P vs NP the only currently open problem in math where there has been considerable effort in showing what techniques <i>won't work</i>? There may be some others in set theory where the conclusion <i>Ind of ZFC</i> is a real option, but how about in fields of math where we expect to get a real answer? <li> If P=NP (which I doubt) then a simple-to-follow-but-quite-clever proof that eluded us all is plausible. If P\ne NP then I doubt this would happen. </ol>GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com21tag:blogger.com,1999:blog-3722233.post-33309991906700444012008-11-11T07:16:00.000-06:002008-11-11T07:17:24.487-06:00A few weeks ago Bill <a href="http://weblog.fortnow.com/2008/10/weird-sumith-largestwallet-revisited.html">complained</a> about how hard it is to get an electronic journal version of Barrington's theorem. Though Barrington's theorem was brand spanking new and exciting when I started graduate school in 1985 and it remains one of my <a href="http://eccc.hpi-web.de/eccc-reports/1994/TR94- 021/index.html">favorite theorems</a>, it doesn't often get taught in many graduate complexity courses these days. So let me talk about one of the great complexity results that, in some sense, lets you count in constant space. <p> Formally the theorem states that polynomial-size bounded-width branching programs have the same computation power as Boolean formulas. A branching program is a directed acyclic graph where all but two nodes are labelled by a variable name and has out-degree two: one edge labelled true and the other false. The other two nodes are the terminal nodes labelled accept and reject. There is a single root of in-degree zero. From the root, one follows a path following the true node if the labelled input variable is true and false otherwise and accepting or rejecting the input based on the terminal node reached. Layer the branching program based on the distance of each node from the root and the width is the maximum number of nodes in any layer. <p> Barrington showed that width-five branching program can simulate any Boolean formula and thus the complexity class NC¹ which includes the majority function. But the branching program in any layer can only remember one of five nodes, less than three bits of information as it processes through the graph. Yet you still can tell if a majority of input variables are true. Amazing. <p> The key to Barrington's proof is that the group S₅ (permutations on five elements) is non-solvable i.e., there are permuatations &sigma; = (12345) and &tau; = (13542) such that &sigma;&tau;&sigma;^-1&tau;^-1 is not the identity permutation. There is a simple write-up of the proof on page 60-61 of the Boppana-Sipser <a href="http://www.cs.princeton.edu/courses/archive/spr06/cos522/circuitsurvey.ps">survey</a>. <p> Some neat consequences of Barrington's theorem. <ul> <li>Regular languages are NC¹-complete under projections of the inputs. <li>One can compute any language in PSPACE using not much more than a clock and constant bits of memory. (<a href="http://dx.doi.org/10.1142/S0129054191000054">Cai and Furst</a>) </ul>Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com10tag:blogger.com,1999:blog-3722233.post-86799312734140198542008-11-10T12:33:00.001-06:002008-11-10T12:35:46.040-06:00TWO ITEMS: <br> <br> I) Reminder: <a href="http://www.umiacs.umd.edu/conferences/stoc2009/">STOC</a> submission abstracts due today. <br> <br> <pre> <FONT SIZE=+1> II) New York Area Theory Day Organized by: NYU/IBM/Columbia External sponsorship by: Google Friday, December 5, 2008 The Theory Day will be held at Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, Auditorium 109, New York. Program 9:30 - 10:00 Coffee and bagels 10:00 - 10:55 Prof. Assaf Naor Approximate Kernel Clustering 10:55 - 11:05 Short break 11:05 - 12:00 Prof. Joe Mitchell Approx Algs for some Geometric Coverage and Connectivity Problems 12:00 - 2:00 Lunch break 2:00 - 2:55 Dr. Jonathan Feldman A Truthful Mechanism for Offline Ad Slot Scheduling 2:55 - 3:15 Coffee break 3:15 - 4:10 Prof. Yishay Mansour TBA For directions, please see <a href="http://www.cims.nyu.edu/direct.html">here</a> and <a href ="http://cs.nyu.edu/csweb/Location/directions.html">here</a> (building 46) To subscribe to our mailing list, follow instructions at <a href ="http://www.cs.nyu.edu/mailman/listinfo/theory-ny">here</a> Organizers: Yevgeniy Dodis dodis@cs.nyu.edu Tal Rabin talr@watson.ibm.com Baruch Schieber sbar@watson.ibm.com Rocco Servedio rocco@cs.columbia.edu ======================================================================= Prof. Assaf Naor (New York University) Approximate Kernel Clustering In the kernel clustering problem we are given a large n times n positive semi-definite matrix A=(a_{ij}) with \sum_{i,j=1}^n a_{ij}=0 and a small k times k positive semi-definite matrix B=(b_{ij}). The goal is to find a partition S_1,...,S_k of {1,...n} which maximizes the quantity \sum_{i,j=1}^k (\sum_{(p,q)\in S_i\times S_j} a_{pq}) b_{ij}. We study the computational complexity of this generic clustering problem which originates in the theory of machine learning. We design a constant factor polynomial time approximation algorithm for this problem, answering a question posed by Song, Smola, Gretton and Borgwardt. In some cases we manage to compute the sharp approximation threshold for this problem assuming the Unique Games Conjecture (UGC). In particular, when B is the 3 times 3 identity matrix the UGC hardness threshold of this problem is exactly 16*pi/27. We present and study a geometric conjecture of independent interest which we show would imply that the UGC threshold when B is the k times k identity matrix is (8*pi/9)*(1-1/k) for every k >= 3. Joint work with Subhash Khot. ------------------------------------------------------------------------- Prof. Joe Mitchell (Stony Brook University) Approx Algs for some Geometric Coverage and Connectivity Problems We examine a variety of geometric optimization problems. We describe some recent progress in improved approximations algorithms for several of these problems, including the TSP with neighborhoods, relay placement in sensor networks, and visibility/sensor coverage. We highlight many open problems. ------------------------------------------------------------------------- Dr. Jonathan Feldman (Google) A Truthful Mechanism for Offline Ad Slot Scheduling Targeted advertising on web pages is an increasingly important advertising medium, attracting large numbers of advertisers and users. One popular method for assigning ads to various slots on a page (for example the slots along side web search results) is via a real-time auction among advertisers who have placed standing bids for clicks. These "position auctions" have been studied from a game-theoretic point of view and are now well understood as a single-shot game. However, since web pages are visited repeatedly over time, there are global phenomena at play such as supply estimates and budget constraints that are not modeled by this analysis. We formulate the "Offline Ad Slot Scheduling" problem, where advertisers are scheduled beforehand to slots on a web page for portions of the day. Advertisers specify a daily budget constraint, as well as a per-click bid, and may not be assigned to more than one slot on the page during any given time period. We give a scheduling algorithm and a pricing method that amount to a truthful mechanism under the utility model where bidders try to maximize their clicks, subject to their personal constraints. In addition, we show that the revenue-maximizing schedule is not truthful, but has a Nash equilibrium whose outcome is identical to our mechanism. Our mechanism employs a descending-price auction that maintains a solution to a machine scheduling problem whose job lengths depend on the price. Joint work with Muthu Muthukrishnan, Eddie Nikolova and Martin Pal. ------------------------------------------------------------------------- Prof. Yishay Mansour (Google and Tel Aviv University) TBA ------------------------------------------------------------------------- </FONT> </pre>GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com0tag:blogger.com,1999:blog-3722233.post-80440834064638500102008-11-07T12:11:00.002-06:002008-11-07T12:53:02.460-06:00Those of us who have taught logic to students are familiar with some of the fallacies they make: (1) confusing OR with XOR (reasonable given English Lang use), (2) thinking that (a--> b) --> (b-->a) and (3) thinking that from <br> <br> A1 AND A2 AND A3 --> B <br> <br> you deduce something about the writer's <i>opinion</i> of A3. <br> <br> This recently happened, though it wasn't a student. It was a commenter on this blog. In a recent blog I wrote about McCain's concession speech: <blockquote> If he has that way the entire time he might have won (if he also didn't pick Palin and we didn't have the economic crisis and we were more clearly winning the Iraq War). </blockquote> This is an IF-THEN statement. There is no logical way to deduce what I think of any of the premises. One of the commenters committed error (3) above: <blockquote> A country is destroyed and half million people are killed, and yet the only thing you feel regret about is not "more clearly winning". Excuse me, Professor Gasarch, I never held hope for the humanity of US, but a comment like this from an intellectual in this country, just taught me how coldblooed the americans can be." </blockquote> The commenter raised an interesting question: If a writer says A-->B then what can you deduce about the writers opinion of A? <ol> <li> If the work is in Large Cardinals then likely the writer thinks that the Large Cardinal hypothesis is true. Note that we do not know this logically. <li> In papers that prove things contingent on P\ne NP or that factoring is hard or the usual derand assumptions the authors thing the assumption is true. Note that we know this by sociology, not by logic. <li> (I may be off on this one- if so please correct.) Non-Euclidean Geometry was started by assuming the Parallel Post was false, hoping to prove that that assumption was FALSE, and seeing what can be derived from it. Let A be <i>For a line L and a point p not on that line there are an infinite number of lines through p that do not intersect L</i>. Let B be <i>The sum of the angles of a triangle are LESS THAN pi.</i> When someone proved A implies B they may have thought that A was false. <li> Pat Buchanan said (I am paraphrasing) <blockquote> <i>If McCain had presented more ties linking Obama to Ayers and Wright then he would have won.</i> </blockquote> While this could be a simple IF-THEn statement, given who he is we know that he things these ties are relevant. Keith Oberman may have expressed a similar sentiment differently: <blockquote> <i>If McCain had presented more lies linking Obama to Ayers and Wright then he would have won.</i> </blockquote> In this case we can tell what Keith Oberman thinks of the assumption. <li> SO- if someone says A-->B then you can't really deduce what the speaker thinks of A LOGICALLY, but you can use other things he has said and his reputation to discern what he thinks of A. Reasoining from context and personality can be useful, though it is not as rigorous as we are used to. Students in a logic course should not use it. </ol>GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com13tag:blogger.com,1999:blog-3722233.post-56172648633364947312008-11-06T06:31:00.000-06:002008-11-06T06:32:22.471-06:00Michael Crichton <a href="http://www.nytimes.com/2008/11/06/books/06appr.html?partner=permalink&exprod=permalink">passed away</a> yesterday. His early novels and movies showing the potential dark sides of technology had a strong impact on me in my youth. <p> <a href="http://www.amazon.com/gp/product/0060541814?ie=UTF8&tag=computation09-20&linkCode=as2&camp=1789&creative=9325&creativeASIN=0060541814">The Andromeda Strain</a><img src="http://www.assoc-amazon.com/e/ir?t=computation09-20&l=as2&o=1&a=0060541814" width="1" height="1" border="0" alt="" style="border:none !important; margin:0px !important;" /> deals with an extraterrestrial virus from a military satellite. The movie <a href="http://www.imdb.com/title/tt0070909/">Westworld</a>, written and directed by Crichton, is about a fantasy land where a gun-slinging robot, played by Yul Brynner, doesn't behave as he should. <p> <a href="http://www.amazon.com/gp/product/0060092572?ie=UTF8&tag=computation09-20&linkCode=as2&camp=1789&creative=9325&creativeASIN=0060092572">The Terminal Man</a><img src="http://www.assoc-amazon.com/e/ir?t=computation09-20&l=as2&o=1&a=0060092572" width="1" height="1" border="0" alt="" style="border:none !important; margin:0px !important;" /> doesn't refer to someone about to die but direct connections between humans and computers. If I remember right people became addicted to stimulating themselves with these connections. Addicted to the network? You have to be kidding. <p> My favorite Crichton book is <a href="http://www.amazon.com/gp/product/0060502304?ie=UTF8&tag=computation09-20&linkCode=as2&camp=1789&creative=9325&creativeASIN=0060502304">The Great Train Robbery</a><img src="http://www.assoc-amazon.com/e/ir?t=computation09-20&l=as2&o=1&a=0060502304" width="1" height="1" border="0" alt="" style="border:none !important; margin:0px !important;" /> about the meticulous planning and execution of a massive gold heist on a train in 1855. Not much technology but a very logical plot line. The <a href="http://www.imdb.com/title/tt0079240/">movie</a>, also written and directed by Crichton, not suprisingly follows the book quite closely. <p> I haven't enjoyed his later work as much. The mathematician Ian Malcomb in <i>Jurassic Park</i> comes off as a babbling philosophical know-it-all who happens to be always right. The ridiculous holographic database in <i>Disclosure</i> is just embarrassing. These later books often have gratuitous action scenes just so they might make better movies. <p> Nevertheless Crichton knew how to make technology very creepy. Even if these books were not quite that realistic they got the young me excited (and worried) about the power of technology and computers.Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com2tag:blogger.com,1999:blog-3722233.post-65025323389943784722008-11-05T10:58:00.000-06:002008-11-05T10:59:12.895-06:00Random comments on the election. <ol> <li> John McCain gave a nice concession speech and was excellent on SNL on Saturday. If he was that way the entire time he might have won (if he also didn't pick Palin and we didn't have the economic crisis and we were more clearly winning the Iraq War). However, I've heard that line before- Kerry, Gore, Dole also looked alot better after they lost. Are candidates overly managed and overly cautious? Does this work against them? (Obama seems to have escaped that.) <li> Whenever a party loses it splits into factions: (1) <i>We lost because we strayed from our true principles.</i> They can split further on what the true principles are. Some of these may support Palin in 2012. (2) <i>We lost because we are too isolated from the mainstream.</i> Some of these may blame Palin for the defeat. <li> Could any Republican have won the Presidency year? With an unpopular war and the economic crisis they would have needed a weak oponent and some distance from George Bush (Mitt Romney 2006 might have worked). Obama was strong competition and John McCain was seen (fairly or unfairly) as being just like W. <li> Hillary-supporters had basically two arguments in the primaries: (1) <i>Hillary has a better chance of beating McCain then Obama does.</i> This has proven false. Or has it? <i>better chance</i>- how can that be quantified once the event has happened. (2) <i>Hillary would make a better president then Obama.</i> We will never know. <li> Obama ran an excellent campaign. McCain ran a terrible campaign. McCain had current events against him (as Colbert has said <i>the truth has a liberal bias</i>). Here is a silly statement: <i>Obama's victory is due 30% to his campaign, 40% to McCain's campaign, and 30% to reality.</i> I just made up those numbers, but can that question be asked and answered? <li> This is why I study math. Math has well defined questions that (for the most part) have answers (though we may not know them yet). But the question <i>why did Obama win?</i> can't really be asked rigorouly or answered definitively. One can even criticize how I phrased it- should I have asked <i>why did McCain lose?</i>? </ol>GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com9tag:blogger.com,1999:blog-3722233.post-53216737044913859112008-11-04T05:34:00.002-06:002008-11-04T05:40:07.401-06:00I made a <a href="http://electoralmarkets.com/fixed">snapshot</a> of the electoral markets map at 5 PM Central time Monday to compare to the actual votes. Meanwhile you can continue to watch the markets aggregate rumors and results in real time at <a href="http://electoralmarkets.com">electoralmarkets.com</a>. <p> I started a couple of different posts for today but nothing seemed to fit. This is an exciting day for America and possibly the world. If I was young and foolish I'd head down to Grant Park tonight for the big rally (as some of my younger colleagues will do) but now just plan to be at home sharing the experience with my family. Go vote if you can and let's watch history get made!Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com4tag:blogger.com,1999:blog-3722233.post-76945279066347561142008-11-03T10:02:00.000-06:002008-11-03T10:04:11.740-06:00I had my Graduate Class in Communication Complexity VOTE FOR PREZ in a secret ballot. The rules were: <b>They could vote for anyone on the ballot in Maryland, (I supplied a ballot with all of the candidates in Maryland) OR write someone in OR write NONE OF THE ABOVE.</b> Here are the candidates and how many votes they got. <ol> <li> Obama-Biden, Democrat party: 11 votes <li> McCain-Palin, Republican: 1 vote <li> McKinney-Clemente, Green: 1 vote <li> Barr-Root, Libertarian: 0 vote <li> Nader-Gonzalez, Independent: 1 vote <li> Baldwin-Castle, Constitution: 0 votes <li> None of the Above: 1 vote. </ol> Speculation: <ol> <li> Usually the Republican does better than this, and McCain is one of those Republicans who (perhaps used to) appeal to moderates and even democrats. So why only one vote? (1) ``I used to like McCain before he turned rightward this campaign'', (2) My class actually likes Obama. In the past there were people who couldn't stand Kerry or Gore, so while they didn't like Bush, they voted for him anyway. <li> Usually I get one or two Libertarian voters. Why note this year? Speculation: (1) They think of Barr are really being a republican, (2) They think Obama really does transcent party and ideology. (3) The libertarians are tired of having their votes not count. (4) They got confused by the butterfly ballot that I used. <li> Our student body is somewhat liberal. Or maybe its just that the students at Univ of MD interested in applying Ramsey Theory to Communiation Complexity are somewhat liberal. <li> One of my colleagues was amazed that McCain got one vote. <li> Of the 15 people in my class, around 10 are from other countries. <li> This could be bad news for Mccain. There is that classic saying: <i>as goes Graduate Communication Complexity, so goes the nation</i>. <li> Is it foolish to look at a small poll from an obviously biased source? Perhaps yes, but compare that to the networks yammering on enlessly about small shifts here and there. </ol>GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com5tag:blogger.com,1999:blog-3722233.post-62495794193932811632008-10-31T10:50:00.000-05:002008-10-31T10:51:50.325-05:00(Guest post from Rahul Santhanam) <br><br> As promised, I did do a bit of experimenting this FOCS in terms of attending talks from other areas. Here's an encapsulation of the results: <br><br> <b>Cryptography</b> - Yevgeny Vahlis spoke about his negative result with Boneh, Papakonstantinou, Rackoff and Waters on black-box constructions of identity-based cryptosystems (cryptosystems in which an arbitrary string can be used as a public key) from trapdoor permutations. ID-based cryptosystems have been extensively studied recently in work of Dan Boneh and others. Security of known constructions is proved in the random oracle model, and it would be interesting to base security on the same assumptions as those used in standard public-key cryptography. This result indicates this might be too much to hope for, at least using standard techniques. <br><br> <b>Learning</b> - Adam Klivans gave an excellent talk on "Learning Geometric Concepts via Gaussian Surface Area" (with O'Donnell and Servedio). There's been a lot of interesting work recently on learning in the presence of random or adversarial noise. It's known that functions with low noise sensitivity, or even with low Gaussian noise sensitivity, can be learned efficiently in this setting, but these quantities are hard to bound in general. The current work resolves some open problems about learnability of geometric concept classes by using some deep mathematical results relating Gaussian noise sensitivity to Gaussian surface area, and working with the latter more tractable quantity. <br><br> <b>Games with Entangled Provers</b> - I went to a couple of talks on another currently hot topic: the power of two-prover games with entangled provers. A semi-definite programming formulation due to Tsirelson can be used to show that the optimal value can be computed efficiently for a very simple form of 2-prover games, known as XOR games. The first talk that I attended was given by Thomas Vidick on "Entangled Games are Hard to Approximate" (with Kempe and Kobayashi and Matsumoto and Toner) - he showed a reduction from the problem of approximating the value of 2-prover games for classical provers (known to be NP-complete) to the problem of approximating the value of 3-prover games for entangled provers. A complementary talk by Ben Toner on "Unique Games with Entangled Provers are Easy" (with Kempe and Regev), showed that for unique games, the optimal value can actually be approximated efficiently using "quantum rounding" to a semi-definite program. The most interesting open problem in this area seems to be to derive some sort of upper bound on the complexity of approximating the value for general games. <br><br> <b>Algorithms</b> - I heard Dimitris Achlioptas speak on "Algorithmic Barriers from Phase Transitions" (with my colleague Amin Coja-Oghlan). This paper tries to understand the reason why simple algorithms for constraint satisfaction problems on random instances fail in the region around the threshold, by showing that this "region of failure" coincides with the region where the structure of the solution space changes from being connected to being (essentially) an error-correcting code. Rather intriguing that a computational fact, the success or failure of standard algorithms, is so closely related to a combinatorial artifact. Finally, I went to Grant Schoenebeck's talk on proving lower bounds for the Lasserre hierarchy of semi-definite programming formulations of CSP problems, which is interesting because a number of different algorithmic techniques including the Arora-Rao-Vazirani formulation of Sparsest-Cut can be implemented in the lower levels of the hierarchy. Grant's result uses a connection to the width complexity of resolution, which I found very surprising, but then my understanding of this area is rather naive... <br><br> All interesting stuff, but I'd actually prefer FOCS to be even broader, and representative of all areas of theory. If that requires multiple sessions, so be it. Currently, FOCS seems to be an algorithms, complexity and combinatorics conference with papers from other areas filtering in unpredictably depending on the composition of the committee. It's very creditable that the standard of papers has remained consistently high (or even improved) over the years. But with several major sub-areas (semantics and verification, concurrency theory, database theory, theory of distributed computing, computational geometry, computational biology etc.) represented barely or not at all, it's quite hard to still make the case that FOCS and STOC are absolutely central to theoretical computer science as a whole. I guess the question is how much we value FOCS and STOC being core conferences?GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com10tag:blogger.com,1999:blog-3722233.post-25126238142467859762008-10-30T06:32:00.000-05:002008-10-30T06:33:23.666-05:00A hodgepodge of election stuff, in my last post before November 4. <p> The <a href="http://electoralmarkets.com">markets</a> and <a href="http://fivethirtyeight.com">polls</a> both suggest that the election is not that close. There's no question who will win in my (and Obama's) home state. The senate race here is even less interesting with the Republicans not even bothering to mount a serious campaign against the incumbent and Majority Whip, Dick Durbin. At least the house race in my district is tight with the incumbent, Mark Kirk, a moderate republican running against Dan Seals, an up and coming African-American. Sounds familiar. <p> Before voting, check out the answers Obama and McCain both gave to <a href="http://www.sciencedebate2008.com/www/index.php?id=42">Science Debate 2008</a>. Keep in mind that science will likely get a back seat given the tight budget constaints that we will have in the next several years. McCain's promise to freeze most federal spending will be particularly bad for science. <p> In the category of &quot;Good Searching means Less Privacy&quot; comes the <a href="http://elections.nytimes.com/2008/president/campaign-finance/search-contributions.html">Contributions Search Engine</a> on the New York Times site. Type in a relatively unique name like &quot;Fortnow&quot; and you'll discover my $255 donation to the Obama campaign. In full disclosure, I also donated $100 to Obama in the primaries. <p> So why $255? Did I really mean to donate the maximum I could in one unsigned byte? Actually $255 = $1000/4 + $5, with the $5 coming from one of my daughters who wanted to add her own contribution. I still live in a base-ten world.Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com5tag:blogger.com,1999:blog-3722233.post-81987597974176929422008-10-29T13:55:00.001-05:002008-10-31T18:57:16.892-05:00(A quick note: Howard Karloff is organizing an <a href="http://geomblog.blogspot.com/2008/10/soda-2009-south-pacific-event.html">excursion</a> to the South Pacific during SODA. Sign up by November 3.) <br> <br> And now for todays post: <br> <br> What do the names Pascal, Hilbert and Mittag-Leffler have in common, aside from all being names of math folks? <br> <br> I have AN answer in mind. You may very well give me other ones. I'll be curious if anyone give me the one I had in mind.GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com10tag:blogger.com,1999:blog-3722233.post-19313864300527427292008-10-28T08:55:00.005-05:002008-11-03T11:26:05.207-06:00<i>Rahul Santhanam continues to spread the word from FOCS</i> <p> Conferences are not really about the talks, they're about socializing and gossip. Who's having an affair with whom? Who's been drinking too much? It's for answers to questions like these for which we brave jet lag, find others to teach classes for us, endure conference food&hellip. <p> Well, not quite. Poets and artists might gossip about such things, but scientists are on a higher plane, of course; we're beings of pure reason, are we not? The questions that concern us tend to be more of the form &quot;Who's deserted University X for University Y?&quot; & &quot;Who's been spending weeks holed up in his room thinking about Conjecture Z?&quot;. And while I'm sure there are those of you who want to know more about the various research addictions triggered off by Razborov's <a href="http://eccc.hpi-web.de/eccc-reports/2008/TR08-081/">proof</a> of Bazzi's theorem, jobs news is probably of more general interest. <p> So here's what I've learned in the past week: <p> Emanuele Viola &rarr; Northeastern <br> Andrej Bogdanov &rarr; Chinese University of Hong Kong <br> Nisheeth Vishnoi &rarr; LRI, Paris <br> Neeraj Kayal &rarr; Microsoft Research, Bangalore <br> Brent Waters &rarr; University of Texas, Austin <br> Shang Hua-Teng &rarr; University of Southern California, Los Angeles <br> [Lance's Note: Rahul Santhanam &rarr; Edinburgh] <p> I rely on commenters to make good the omissions. <p> It certainly seems as if there's been more movement than usual on the job scene since STOC. The grad students and postdocs I've talked to seem pretty apprehensive about the market for next year, and with fair reason, I think. The market hasn't been that great for theory in the past couple of years, in any case, and the financial crisis seems likely to lead to funding cuts and more hiring freezes. <p> Perhaps there is some cause for optimism in the increasing number of postdocs available? The improvement in the NSF situation in the past couple of years means that more faculty in North America are able to hire postdocs. The emergence of Microsoft Research, Cambridge and the new Center for Computational Intractability in Princeton certainly won't hurt. But while having more postdocs around is good for our field, it might not be such a good thing from the point of view of the postdocs themselves. First, there is the intrinsic transience of the position - I had very good research environments in my postdocs at Simon Fraser and Toronto, but I never escaped the feeling of being in Purgatory. Second, there's the fact that job applications and interviews are very time consuming - it's hard to be productive when you know your entire future career might depend on how well you can advertise your research. And do we really want theoretical computer science to become like theoretical physics, where it's normal for graduating students to expect a postdoc apprenticeship of 6-7 years before they can find a permanent job? <p> For theorists not intent on getting a job in North America, the situation might be a little better. There are increasing opportunities in Europe and especially in Asia, as recent job news indicates. In general, the best attitude might be to be realistic about your prospects and to use the competitiveness of the market as motivation for your research.Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com8tag:blogger.com,1999:blog-3722233.post-40658571596268829222008-10-27T07:49:00.001-05:002008-10-27T07:52:11.352-05:00<i>More from Rahul at FOCS</i> <p> I realize I could quite easily spend more time writing about the talks then going to them, so I'll keep it shorter <ul> <li>Gil Kalai gave a vastly entertaining talk on &quot;Elections can be Manipulated Often&quot; (Kalai and Friedgut and Nisan). Clearly a topic of current relevance, but Gil bravely resisted making an Obama-McCain reference. The main result of the paper essentially says that the cumulative manipulation power (meaning their capacity to bring about their preferred global outcome by voting in a way that's different from their actual ranking of the candidates) in any &quot;reasonable&quot; election (where the voting scheme is far from yielding a dictatorship, and is insensitive to the names of the candidates) is invariably high, in a setting where voter preferences are modelled by random choices. The main open question from the talk was to prove that the current financial crisis was unavoidable. <li>Mihai Patrascu gave a talk on his paper &quot;Succincter&quot;, which won the Machtey best student paper award. His paper greatly advances the state of the art in the field of succinct data structures. For instance, the paper shows how to store N &quot;trits&quot; (numbers that are either 0,1 or 2) in N log(3) + O(1) bits of memory with only logarithmic query time. The proof uses a clever recursive encoding scheme. <li>Dana Moshkovitz spoke about her Best Paper-winning work with Ran Raz on constructing sub-constant error 2-query PCPs of nearly linear size. This has been a major open problem for quite a while now, and the resolution of this open problem yields improvements to a large family of hardness of approximation results. The proof builds on earlier work by Moshkovitz and Raz constructing sub-constant error low degree tests of nearly linear size. </ul> There's been precious little controversy at this conference, so I feel duty-bound to stir something up. There's an asymmetry between the two seminar rooms &ndash; one is considerably larger, wider and has better acoustics than the other. Is it a coincidence that the more complexity-oriented talks in Session B are in the smaller room, and the algorithms-oriented Session A talks in the larger not? I think not. This is merely the latest instance in the step-sisterly treatment accorded to complexity theory down the ages, right from when Euclid designed his algorithm but failed to analyze its complexity. I urge all right-minded readers to express their outrage at this state of affairs. <p> More seriously, can't think of a hitch; even lunch yesterday was good. Kudos to Sanjeev Khanna, Sudipto Guha, Sampath Kannan and the student volunteers.Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com2tag:blogger.com,1999:blog-3722233.post-11511475817600162682008-10-27T05:41:00.000-05:002008-10-27T05:42:14.166-05:00<i>Another FOCS report from Rahul</i> <P> The business meeting was compered by Paul Beame. <ol> <li>The local chair Sanjeev Khanna spoke. 270 registered this year, as opposed to 250 last year and 220-230 the year before that. Excelsior! <li>The P.C. report was given by the P.C. chair R.Ravi. Some salient features <ol> <li>349: not the number of reviewed papers, but rather the number of external reviewers <li>June 13, 2008: the Night of the Long Knives, when as many as 150 papers had their hopes quashed. <li>&quot;Succincter&quot;: In an unprecedented double, Mihai's Best Paper Title awardee also wins the Machtey Best Student Paper award <li>Dana Moshkovitz and Ran Raz win best paper for &quot;Two-query PCP with Sub-Constant Error&quot; </ol> <li>Milena Mihail gave a presentation on FOCS 2009, which will be held in Atlanta from November 8-10 next year. <li>Volunteers were requested for hosting FOCS 2010. Three hands shot up instantly, and after a long and contentious debate culminating in a beer-bottle fight... Nah. <li>We all got to vote nine days before the big day. David Shmoys was elected vice-chair of the IEEE Technical Committee on Mathematical Foundations of Computing. <li>A couple of major Prize announcements were made; no suspense involved for readers of this blog. Volker Strassen is the recipient of the Knuth Prize, and Spielman and Teng have won the Godel Prize for their paper on smoothed analysis of linear programming. <li>NSF Report by Sampath Kannan, who's a Division Director in the CCF (Computing and Communications Foundations) program. We theorists seem to have a nice program of our own now directly under CCF called Algorithmic Foundations, which covers most of the traditional STOC/FOCS areas, and has a budget over $30 million for this year. Grant deadlines coming up pretty soon actually: for the Large grants on October 31, for the Medium grants shortly afterward in November, and for the Small ones in December. There was also some information on relevant cross-cutting funding opportunities. <li><a href="http://www.umiacs.umd.edu/conferences/stoc2009/">STOC 2009</a> will be held May 31- June 2 in Bethesda, Maryland. The submission server is already active. Title and short abstract are due November 10, extended abstract is due November 17. <li>Pierre Mckenzie recapitulated CCC 2008 in 30 seconds, and then announced that <a href="http://ccc09.lri.fr/">CCC 2009</a> would be held in Paris. Paris, France, as a matter of fact; excited murmurs from the audience. For a brief moment there complexity theory was cool. <li>David Johnson announced that <a href="http://www.siam.org/meetings/da09/">SODA 2009</a> would be held January 4 - January 6 in New York, and that Volker Strassen would be giving his Knuth Prize lecture there. <li>Miscellaneous announcements, including a long-overdue archiving of old FOCS proceedings in IEEE Xplore ( I believe the only ones left are '60,'61, '63 and '67) and news about the establishment of the Center for Computational Intractability in Princeton, funded by the NSF/CISE Expeditions grant announced earlier on this blog. </ol> That was one of the duller business meetings in recent memory. Which is a good thing, of course &ndash; it means we're all happy and getting along.Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com4tag:blogger.com,1999:blog-3722233.post-17375780567954582492008-10-26T14:46:00.002-05:002008-10-26T14:48:17.826-05:00<i>More from Rahul</i> <p> A typical FOCS day divides up the same way as a day in a cricket test match: pre-lunch session, afternoon session and post-tea session. And approximately the same fraction of the audience is awake and/or paying attention? <p> I set myself the goal of attending the first talk of the day, which naturally meant that I stumbled in around halfway through Manindra Agrawal's talk on "Arithmetic Circuits: A Chasm at Depth Four" (Agrawal and Vinay). This is one of my favorite papers in the conference: the result is surprising, easy to state and not hard to prove. The authors show that an exponential lower bound on arithmetic circuit size for depth-4 circuits actually implies an exponential lower bound on circuit size for general arithmetic circuits. There are precedents for this kind of depth reduction for arithmetic circuits (unlike for Boolean circuits), eg. the Berkowitz-Skyum-Valiant-Rackoff result that polynomial size circuits can be simulated by polylogarithmic-depth circuits, but the nice thing about this result is that it gives an explanation for why most recent progress on arithmetic circuit lower bounds has been in the very low depth regime. Manindra's talk was marred a little by technical glitches, but he has an unparalleled ability to stay cool in a crisis. <p> Then came an excellent talk on Madhur Tulsiani on "Dense Subsets of Pseudorandom Sets" (Reingold, Trevisan, Tulsiani and Vadhan). This is a topic that Luca has said a lot about in his blog, and I certainly can't hope to better that. The final talk in the session was by Timothy Chow on "Almost-natural Proofs", about how the natural proofs framework of Razborov and Rudich ceases to be a barrier to proving circuit lower bounds if it is relaxed slightly. The talk was good, but I was even more intrigued by the speaker. He is unusually wide-ranging in his choice of problems to work on - he comments quite often on the <a href="http://www.cs.nyu.edu/pipermail/fom/">FOM mailing list</a>, and I know he's worked among other things on logics for polynomial time. It's good for our heavily algorithms-and-complexity centered community to have people from outside the mainstream working on our problems. <p> You'll notice that most of the talks discussed so far are complexity-related - old habits die hard. But I did try compensating by going to Mihai Patrascu's talk on "Dynamic Connectivity: Connecting to Networks and Geometry" (Chan, Patrascu and Roditty), about data structures for dynamic connectivity in graphs where both vertex and edge updates are allowed. There did seem to be some elegant ideas involved, but the talk was geared for an audience which knew something already about dynamic data structures, and I didn't follow the details. This reminds me of why I don't tend to go to talks too far afield of areas I work in - presenters do tend to take certain things for granted in their audience, and it makes sense for them to do so, since most members of the audience probably have a reasonable background in the subject of the talk. Also, it wasn't the most enthusiastic of talks, but I am looking forward to Mihai's talks on "Succincter" and "(Data) Structures", both of which concern very natural questions that are interesting even to non-specialists in data structures. <p> Next for me was another algorithmic talk: Chris Umans on "Fast Modular Composition in any Characteristic" (Kedlaya and Umans), which showed that the composition of two polynomials f and g of degree n modulo a third polynomial of the same degree can be computed very efficiently, in time that's nearly linear in n. The proof goes through an earlier reduction by Chris of the problem to simultaneous evaluation of multilinear polynomials on several points; the new contribution is a clever solution to this simultaneous evaluation problem through recursively applying Chinese remaindering. The talk, as is usual with Chris, was crisp and well-organized. <p> That concluded my pre-lunch session &ndash; I wouldn't have been alert enough to do justice to the remaining talks. Stay tuned for a report on the rest of the day's play.Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com1tag:blogger.com,1999:blog-3722233.post-86976458216395460652008-10-26T07:55:00.002-05:002008-10-26T07:59:08.030-05:00<i>Rahul Santhanam reports from Philadelphia.</i> <p> I'm in Philly for <a href="http://focs2008.org/">FOCS</a>, and will be reporting on the extravaganza for this blog, including the drama and suspense of the talks (&quot;Will there be heckling?&quot; &quot;Will he make an Obama joke?&quot; &quot;Will she break the 20-minute barrier?&quot;) and the drunken revelry of the business meeting. Typically, I have a few simple rules for attending talks: <ol> <li>No conflicts with my regular 4 am - noon bedtime. <li>Attending a double-digit number of talks is just as good as attending no talks at all. <li>The title better have the word &quot;complexity&quot; in it. </ol> But with my reporting duties as an excuse, I've resolved to discard my old inertial lifestyle and tax my brain with the new and unfamiliar. Facility location, electronic commerce, quantum entangled games &ndash; bring it on! <p> You could help me with this. If you're a theory junkie who couldn't make it here and there's some talk you really wanted to hear, let me know and I might be able to give you some idea &ndash; the barest idea, or at the very least a fictional idea, of what it was like to be there&hellip;Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com0tag:blogger.com,1999:blog-3722233.post-2715433646419391412008-10-25T06:16:00.003-05:002008-10-25T06:31:52.935-05:00The ACM <a href="http://www.acm.org/press-room/news-releases/knuth-prize-08">announced</a> that Volker Strassen will receive the Knuth Prize for his algorithmic work, most notably on primality, matrix multiplication and integer multiplication. The <a href="http://sigact.acm.org/prizes/knuth/">Knuth Prize</a> is given for major contributions over an extended period of time. The winner gives a Knuth Prize lecture and Strassen will give his at SODA. <p> Strassen <a href="http://en.wikipedia.org/wiki/Strassen_algorithm">matrix multiplication</a> is a simple but amazing recursion to beat the easy cubic bound. And the probabilistic <a href="http://en.wikipedia.org/wiki/Solovay-Strassen_primality_test">algorithm</a> for primality with Solovay drove complexity research into probabilistic computation and helped make modern cryptography possible.Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com1tag:blogger.com,1999:blog-3722233.post-89052494948923111422008-10-24T15:20:00.000-05:002008-10-24T15:21:01.006-05:00I have not blogged much on the election because I doubt I can say anything you haven't already heard. I have gathered here reasons for/against the candidates that you <i>might</i> not have heard. They are NOT mine- they are things I've heard or read. If 1/2 of these comments are new to 1/2 of my readers, I'll be happy. <br> <br> REASONS TO VOTE FOR OBAMA OR AGAINST MCCAIN <ol> <li> I've always wanted a Prez younger than me! <li> Joe Biden is one of the few non-millionaires in the Senate. Hence he understands the working man. <li> If Obama wins then Hillary probably won't be able to run for 8 years. (If McCain wins she can run in 4 years.) <li> In the first debate Obama showed that he was willing to agree with McCain on some things. McCain did not. <li> McCain does not know how to use email. <li> I have two bets that Obama will win. (One is with an African-American who thinks the country will never elect an African-American Prez. She hopes she is wrong and will gladly lose the bet.) <li> The McCain-Palin campaign spent $150,000 on clothes for Sarah Palin. This shows she has no understanding of economics. </ol> REASONS TO VOTE FOR MCCAIN OR AGAINST OBAMA <ol> <li> I've always wanted a Prez older than my grandparents! <li> Joe Biden is one of the few non-millionaires in the Senate and hence has no understanding of Economics. <li> (Someone at my church told me this.) I live in the same Condo as John McCain. He voted for me for President of the Condo Association, so I feel I owe it to him to vote for him for President of America. <li> Sarah Palin is a hockey mom with 5 kids and a job. Hence she understands the working mom. <li> Obama is a Muslim who has been attending Reverend Wrights Christian Church for 20 years. (NOTE- 10% of Americans things Obama is Muslim. 1% think he is Jewish.) <li> An intelligent man who I trust agrees with McCain on many things. That man: Barak Obama (First Debate and a few other things). <li> The Republicans created the mess we're in now, make them clean it up. </ol> REASONS TO VOTE AGAINST BOTH OF THEM <ol> <li> I'm from a non-swing state so my vote does not matter. <li> <a href ="http://www.thedailyshow.com/">The Daily Show</a>, <a href ="http://www.colbertnation.com/home">The Colbert Report</a>, <a href ="http://www.nbc.com/Saturday_Night_Live/">Saturday Night Live</a>, and <a href ="http://www.capsteps.com/">The Capitol Steps</a> won't have much to work with. Obama, McCain, and Biden just aren't that funny. Palin makes political satire redunant. (<i>Alaska is next to Russia and therefore she has Foreign Policy Experience.</i>- is that John McCain? Jon Stewart? John McCain on Jon Stewart's show?) <li> Who do the Assoc of American Political Satirists endorse? Having read <a href ="http://www.thedailybeast.com/blogs-and-stories/2008-10-20/electing-a-punch-line/1/">this</a> I still can't tell. </ol>GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com4tag:blogger.com,1999:blog-3722233.post-81500939056572230492008-10-23T05:22:00.004-05:002008-10-23T08:11:10.923-05:00Maureen Dowd's <a href="http://www.nytimes.com/2008/10/22/opinion/22dowd.html?partner=permalink&exprod=permalink">column</a> yesterday mentioned that Obama was being accused of reading a book about the end of America written by a &quot;fellow&quot; Muslim. Turns out I read the same book, Fareed Zakaria's <a href="http://www.amazon.com/gp/product/039306235X?ie=UTF8&tag=computation09-20&linkCode=as2&camp=1789&creative=9325&creativeASIN=039306235X">The Post-American World</a><img src="http://www.assoc-amazon.com/e/ir?t=computation09-20&l=as2&o=1&a=039306235X" width="1" height="1" border="0" alt="" style="border:none !important; margin:0px !important;" />. <p> Not so much about the end of America, but the gradual ending of America's economic dominance in the world. Zakaria contrasts America today with the rise and fall of the British empire. The book focuses on China and India, their recent rise and the challenges each faces, as well as suggestions for America to keep their competitive edge. <p> At the University level, Zakaria seems quite bullish on America especially in CS. <blockquote> The situation in the sciences is particularly striking. A list of where the world's 1000 best computer scientists were educated shows that the top ten schools are all American. US spending on R&amp;D remains higher than Europe's, and its collaborations between business and education institutions are unmatched anywhere in the world. American remains by far the most attractive destination for students taking 30 percent of the total number of foreign students globally. All these advantages will not be erased easily, because the structure of European and Japanese university&mdash;mostly state-run bureaucracies&mdash;is unlikely to change. And while China and India are opening new institutions, it is not that easy to create a world-class university out of whole cloth in a few decades. Here's a statistic about engineers that you might not have heard. In India, universities graduate between 35 and 50 Ph.D.'s in computer science each year; in America, the figure is 1,000. </blockquote> We have seen some countries like Israel create world-class universities out of whole cloth in a few decades. The US did it themselves in the late 19th century. So China and India could have dramatical success at the university level if they make the commitment to resources and change. Until recently the Indians and Chinese have come in large numbers to our graduate programs and have just stayed in the US. Now, for may reasons not the least of which is the improving economic conditions in both countries, we are seeing more researchers heading back to their native countries whether it be Turing Award winner Andy Yao or just a large number of Indian scientists that are moving or plan to move back to India. Imagine the changes we've seen at Israeli universities in a country with a 10-digit population size.Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com18tag:blogger.com,1999:blog-3722233.post-15569003348144111542008-10-22T08:05:00.000-05:002008-10-22T08:07:00.623-05:00<ol> <li> In <a href ="http://weblog.fortnow.com/2008/10/interesting-summation.html#comments"> Richard Matthew McCutchen's Guest post</a> he challenged the readers to figure out a certain sum. And I challenged them to help me do a better pi in html. <ol> <li> KKMD (comment 3) is correct, it is the largest prime that divides n. The formal proof is <a href = "http://www.cs.umd.edu/~gasarch/BLOGPAPERS/mattsum2.pdf"> here</a>. <li> pi: I originally used an & followed by pi which yields &pi <li> pi: I was supposed to use & followed by pi and then a semicolon which yields &pi; <li> pi: Lance says to use &lt; span style=&quot; font-family:times&quot; &gt; &amp; pi;&lt;/span&gt; which yields <span style="font-family:times">&pi;</span> </ol> <li> Some of the comments from the posting on <a href = "http://weblog.fortnow.com/2008/10/finding-ith-largest-of-n-numbers-for-in_17.html">ith largest of n</a> inspire some random thoughts from me: <ol> <li> <i>Why on earth would anyone be doing a computer search for such algorithms?</i> (for algorithms to find ith largest of n with as few comparisons as possible). One hope is that with enough empiricial evidence we may get EXACT values for how many comparisons it takes. Also, for the challenge! But YES, limited practical value. But see next point. <li> <i>Why do you think your conjecture is true?</i> The known algorithms for finding ith largest of n take n+(i-1)log n + O(1) and begin by making comparisons pairwise. For i small this is optimal up to the O(1). So in this realm it seems likely. But what is `i small'? When finding the 10th largest out of 40 is that more like i small or like you are finding the n/4th largest element? Don't know- want to find out. Another reason to do this- when is small small? <li> A commenter says there is interesting info in a Tech Report that may be <i>hard to find</i>. The notion of a Tech Report that is hard to find may be unfamiliar to young people. With the web it may be easier to find some unpublished papers then some published ones, depending on who the authors are and the journals are. (If someone knows where the Journal version of Barrington's paper on Bounded Width BP containing NC¹ is online please let me know. Barrington does not have it on his website or know where it is online.) </ol> <li> Lance recently recommended a certain wallet in <a href="http://weblog.fortnow.com/2008/08/ultimate-wallet.html">this blog</a>. On his advice I bought it and its great. What I wonder is, how big a mover and shaker is Lance? Should they have given him a free wallet since he influences others? How many others have bought it based on his recommendation? At <a href="http://weblog.fortnow.com/2008/10/theory-day-at-university-of-maryland.html">Maryland Theory Day</a> there was a talk about how sellers should give people of influence discounts since they will influence others to buy their product. This is not a new idea, but with modern technology it can be better targeted. </ol>GASARCHhttp://www.blogger.com/profile/06134382469361359081noreply@blogger.com13tag:blogger.com,1999:blog-3722233.post-59899658402721425702008-10-21T06:12:00.000-05:002008-10-21T06:13:04.669-05:00The timing of the FOCS conference in late October often overlaps with the World Series and on rare occasions they happen in the same city at the same time. Checking back through the 48 previous FOCS only once before in 1997 FOCS was in Miami Beach October 19-22 with Game 2 of the world series October 19th with the Florida Marlins losing to Cleveland at Pro Player Stadium in Miami. <p> A couple of other close calls. In 1992, I had tickets to a potential series in Pittsburgh but I've told that sad story <a href="http://weblog.fortnow.com/2004/10/go-sox.html">before</a>. In 1999, FOCS was held in New York October 17-19 and the Yankees hosted Atlanta a week later in the series. Last year FOCS was held in Providence October 20-23 and just a short drive up I-95 the Red Sox beat the Rockies twice October 24-25. <P> This year we have a perfect overlap. The <a href="http://focs2008.org/">2008 FOCS Conference</a> runs October 25-28 in downtown Philadephia and Games 3, 4 and 5 (if necessary) of the Series between the Phillies and the Tampa Bay Rays will be held October 25-27 three miles south in Citizens Bank Park. <p> But I'll miss the fun and won't make FOCS this year. I'd love to hear from any FOCS attendee that manages to snag World Series tickets and gets to enjoy the two great fall classics.Lancehttp://www.blogger.com/profile/06752030912874378610noreply@blogger.com0