Revision as of 22:20, 5 February 2008 edit Dcoetzee (talk \| contribs) 37,529 edits →Key results: Define clique problem ← Previous edit		Revision as of 14:34, 24 March 2008 edit undo TimR (talk \| contribs) Extended confirmed users, Pending changes reviewers 3,265 edits m Spelling correction Next edit →
Line 28: {{cite book\|title=Introduction to Circuit Complexity: a Uniform Approach\|last=Vollmer\|first=Heribert\|publisher=[[Springer Verlag]]\|date=1999\|id=ISBN 3-540-64310-9}} [http://www.math.tau.ac.il/~zwick/scribe-boolean.html Lecture notes for a course of Uri Zwick on circuit complexity] *[http://www.google.com/url?sa=t&ct=res&cd=2&url=http%3A%2F%2Fftp.cs.rutgers.edu%2Fpub%2Fallender%2Ffsttcs.pdf&ei=LGlBRauMJovqwQK_o-SPCg&sig=__I4BLKKJifqY6JTKPi2gQHw5kumY=&sig2=JH2HmoreDuucxf6_FGVs5Q ''Circuit Complexity before the Dawn of the New ~~Millenium~~Millennium'', a 1997 survey of the field by Eric Allender] [[Category:Computational complexity theory]]

Circuit complexity: Difference between revisions