in theory

"Marge, I agree with you – in theory. In theory, communism works. In theory." — Homer Simpson

Search

Main menu

Skip to primary content

Home
About
LaTeX to WordPress
Lecture Notes

Post navigation

← Previous Next →

Zack Kim

Posted on August 21, 2007 by luca

See also Fur Elise, and more at his website.

Share this:

Print
Facebook
Twitter
Reddit
Google

Like this:

Like Loading...

Related

This entry was posted in diversions and tagged Simpsons by luca. Bookmark the permalink.

Leave a Reply Cancel reply

Enter your comment here...

Fill in your details below or click an icon to log in:

Email (required) (Address never made public)

Name (required)

Website

You are commenting using your WordPress.com account. ( Log Out / Change )

You are commenting using your Twitter account. ( Log Out / Change )

You are commenting using your Facebook account. ( Log Out / Change )

You are commenting using your Google+ account. ( Log Out / Change )

Connecting to %s

Notify me of new comments via email.

Recent Comments

	amateurMath on CS294 Lecture 7: Higher order…
	Huck Bennett on Congratulations to the 2016 Kn…
	Huck Bennett on Congratulations to the 2016 Kn…
	Huck Bennett on Congratulations to the 2016 Kn…
	Michel Goemans on CS359G Lecture 11: ARV

math

Doron Zeilberger
Terry Tao
Tim Gowers

non-theory

Bitch PhD
The Peking Duck
Unfogged

theory

3D Pancakes
Complexity Blog
Geomblog
Informatics Weekly
James Lee
My Biased Coin
my slice of pizza
Oded Goldreich
Process Algebra Diary
Richard Lipton
Shtetl Optimized
Theory Matters

Search

Archives

Archives

Categories

Categories

Additive Combinatorics Apple ARV average-case complexity Avi Wigderson Ben Green CCA security Cheeger inequality Circuit complexity circuit lower bounds Conceptual contributions cryptography CS254 2010 Dan Spielman Decision Diffie-Hellman eigenvalues eigenvectors Expanders Fields Medal FOCS 2006 FOCS 2010 Goldreich-Levin Graph Isomorphism hard-core predicate Hard-Core Sets ICM 2006 Integrality gap Laplacian LaTeX LaTeX in WordPress Leonid Levin linear programming Luby-Rackoff MAC Max Cut maximum flow Metric embeddings Moses Charikar Natural Proofs Notices of the AMS Oded Goldreich one-way function Paul Erdos PCP Proposition 8 pseudorandom function Pseudorandomness pseudorandom permutation public-key encryption quadratic residue Random Oracle Model random walks Regularity Lemma Riemann Hypothesis RSA safety SAT signature schemes Silvio Micali sparsest cut spectral graph theory Spectral partitioning Stephen Colbert STOC and FOCS Szemeredi Theorem Tamar Ziegler Terence Tao things that are excellent things that are terrible Tim Gowers Turing Centennial unique games World Cup Zero Knowledge zig-zag product

Top Posts

Congratulations to the 2016 Knuth Prize Selection Committee!
Lecture Notes
CS261 Lecture 6: Duality in Linear Programming
LaTeX to WordPress
Presenting a Beamer Talk the Right Way
CS 276 Lecture 4: Security for Multiple Encryptions
CS 261 Lecture 10: the fattest path
CS261 Lecture 5: Linear Programming
Random kSAT
CS261 Lecture 2: Steiner Tree Approximation

Blog at WordPress.com.

%d bloggers like this: