link:http://in-theory.blogspot.com/2007/08/more-ways-to-prove-unsatisfiability-of.html

Browse Top Stories

Published

Last hour

Last 12 hours

Anytime

Subscribe:

Blogs Alerts

Atom | RSS

Sorted by relevance Sort by date

(luca trevisan) checking the quasirandomness of graphs and hypergraphs

15 Feb 2008 by Terence Tao
[this post is authored by luca trevisan. - t.] notions of “quasirandomness” for graphs and hypergraphs have many applications in combinatorics and computer science. several past posts by terry have addressed the role of quasirandom ...
What's new - http://terrytao.wordpress.com/

Stay up to date on these results:

Create an email alert for link:http://in-theory.blogspot.com/2007/08/more-ways-to-prove-unsatisfiability-of.html
Search Google News for link:http://in-theory.blogspot.com/2007/08/more-ways-to-prove-unsatisfiability-of.html
Add a blog search gadget for link:http://in-theory.blogspot.com/2007/08/more-ways-to-prove-unsatisfiability-of.html to your Google homepage
Subscribe to a blog search feed for link:http://in-theory.blogspot.com/2007/08/more-ways-to-prove-unsatisfiability-of.html in Google Reader