Revision as of 21:58, 14 June 2010 edit RobinK (talk \| contribs) Extended confirmed users, Pending changes reviewers 3,059 edits m Reverted 1 edit by 205.201.255.5 identified as vandalism to last revision by 92.137.6.91. (TW) ← Previous edit		Revision as of 17:57, 21 September 2010 edit undo 66.127.54.226 (talk) →References: use direct link to Allender article Next edit →
Line 46: {{cite book\|title=Introduction to Circuit Complexity: a Uniform Approach\|last=Vollmer\|first=Heribert\|publisher=[[Springer Verlag]]\|date=1999\|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~~ftp.cs.rutgers.edu~~%2Fpub%2Fallender%2Ffsttcs~~/pub/allender/fsttcs.pdf~~&ei=LGlBRauMJovqwQK_o-SPCg&sig=__I4BLKKJifqY6JTKPi2gQHw5kumY=&sig2=JH2HmoreDuucxf6_FGVs5Q~~ ''Circuit Complexity before the Dawn of the New Millennium''], a 1997 survey of the field by Eric Allender [http://ftp.cs.rutgers.edu/pub/allender/fsttcs.96.slides.ps slides]. [[Category:Computational complexity theory]]

Circuit complexity: Difference between revisions