theorycenter.cs.uchicago.edu
Center for the Theory of Computing and Allied Areas
http://theorycenter.cs.uchicago.edu/index.php
Chicago Center for the Theory of Computing and Allied Areas The University of Chicago. Toyota Technological Institute at Chicago. Welcome to the Theory Center! Research Experience for Undergraduates. The Center's Summer REU in the Theory of Computing and Machine Learning. Is accepting applications. Deadline: April 24. The Theory of Computing. The Chicago Center for the Theory of Computing and Allied Areas. Is based on an alliance of the University of Chicago. Theory of Computing,.
logicomp.blogspot.com
Logicomp: January 2007
http://logicomp.blogspot.com/2007_01_01_archive.html
Wednesday, January 10, 2007. I have moved again . Anyway, apologies to my avid readers that I was silent for so long. Provided there is time and interest, I will blog again on a weekly basis. Links to this post. Subscribe to: Posts (Atom). I have moved again . View my complete profile. Gillian Russell (Logic and Language). Hal Daume III (NLPers). Kurt Van Etten (LearningComputation). Lance Fortnow (Computational Complexity). Simple template. Powered by Blogger.
logicomp.blogspot.com
Logicomp: November 2005
http://logicomp.blogspot.com/2005_11_01_archive.html
Sunday, November 27, 2005. Australia qualified for the World Cup 2006 in Germany. After 30 years of bad luck, Australia has finally qualified for next year's World Cup in Germany after beating Uruguay in a dramatic penalty shoot-out at Sydney's Telstra Stadium, Australia. Links to this post. Sunday, November 20, 2005. XML = Automata Logic Database. What do you get when you mix automata theory, mathematical logic, and database theory in a big bowl, and stir it vigorously? Author Leonid Libkin /author.
logicomp.blogspot.com
Logicomp: May 2006
http://logicomp.blogspot.com/2006_05_01_archive.html
Tuesday, May 02, 2006. Game theoretic characterization of treewidth. There is no doubt that the notion of treewidth. Introduced by Robertson and Seymour is one of the most important concepts in math and computer science introduced in the past thirty years. Roughly speaking, treewidth of a graph G measures how much G looks like a tree. For example, the treewidths of a tree, of a cycle, and of a clique (with n vertices) are respectively 1, 2, and n. The game goes as follows:. Which does not pass through X.
logicomp.blogspot.com
Logicomp: February 2006
http://logicomp.blogspot.com/2006_02_01_archive.html
Saturday, February 11, 2006. New Book on Parameterized Complexity. Jorg Flum and Martin Grohe just published their new book. Titled Parameterized Complexity Theory. Flum and Grohe are two giants in finite model theory who have contributed so much towards the development of parameterized complexity theory, especially logical characterizations of parameterized complexity classes. At this moment, one can only purchase the book from Springer as they just appeared some time this week. Links to this post.
logicomp.blogspot.com
Logicomp: January 2008
http://logicomp.blogspot.com/2008_01_01_archive.html
Monday, January 14, 2008. Happy New Year 2008! Without further ado, here are some plans for my posts for the next two to three weeks:. Some extensions of pushdown systems and how to do model checking on these structures. I covered the definitions of pushdown systems already in here. But not how to do model checking on these structures. So, I'll start there. Extensions that I will consider including prefix-recognizable systems, ground tree rewrite systems, and some probabilistic extensions.
logicomp.blogspot.com
Logicomp: September 2005
http://logicomp.blogspot.com/2005_09_01_archive.html
Saturday, September 24, 2005. P vs NP: let's think out loud. We all know this question. It is listed as one of the seven millenium problem by Clay Mathematic Institute. We also know that most people believe that P is different from NP. For example, in the P vs. NP Poll. Two most common reasons for believing that P is different from NP are the following:. There are (literally) tons of problems which are NP-complete (i.e. if one is in P, and all will be in P), and nobody has been able to devise any...A pro...
logicomp.blogspot.com
Logicomp: Rahul Santhanam has joined Edinburgh
http://logicomp.blogspot.com/2008/07/rahul-santhanam-has-joined-edinburgh.html
Monday, July 14, 2008. Rahul Santhanam has joined Edinburgh. Rahul Santhanam, Lance Fortnow's. Ex PhD student, has recently joined. Edinburgh's School of Informatics. Warm welcome to him! I am very happy with this record. Cara beli rumah tanpa modal. Thank you for the information. Perumahan baru di tangerang. Thank you. awaited next article. Harga rumah saat ini. Thank you. awaited next article. So many that I can take from this blog very helpful. Notes that are beneficial to my knowledge, thanks. Rumah ...
logicomp.blogspot.com
Logicomp: When does Bob deserve to be a co-author?
http://logicomp.blogspot.com/2008/10/when-does-bob-deserve-to-be-co-author.html
Monday, October 27, 2008. When does Bob deserve to be a co-author? I have recently been reading Bill Gasarch's post. About when Alice deserves to be a co-author. This is definitely a sensitive issue; just check the number of ANONYMOUS comments. I have recently found some advice. That is more oriented towards faculty-student type of collaborations, but is perhaps also suitable in general. Check this link. This comment has been removed by a blog administrator. Article really helped me, thanks sir :). Cara ...
logicomp.blogspot.com
Logicomp: October 2008
http://logicomp.blogspot.com/2008_10_01_archive.html
Monday, October 27, 2008. When does Bob deserve to be a co-author? I have recently been reading Bill Gasarch's post. About when Alice deserves to be a co-author. This is definitely a sensitive issue; just check the number of ANONYMOUS comments. I have recently found some advice. That is more oriented towards faculty-student type of collaborations, but is perhaps also suitable in general. Check this link. Links to this post. Subscribe to: Posts (Atom). When does Bob deserve to be a co-author?
