Revision as of 18:21, 27 March 2021 edit Matthiaspaul (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 137,876 edits →References: improved ref ← Previous edit		Revision as of 16:57, 25 May 2021 edit undo Citation bot (talk \| contribs) Bots 5,865,014 edits Removed parameters. \| Use this bot. Report bugs. \| Suggested by SemperIocundus \| #UCB_webform Next edit →
Line 93: ==Further reading== * {{cite book \|title=Introduction to Circuit Complexity: a Uniform Approach \|author-last=Vollmer \|author-first=Heribert \|author-link=:de:Heribert Vollmer \|publisher=[[Springer Verlag]] \|series=Texts in Theoretical Computer Science. An EATCS Series \|date=1999 \|isbn=978-3-540-64310-4}} * {{cite book \|author-last=Wegener \|author-first=Ingo \|author-link=Ingo Wegener \|title=The Complexity of Boolean Functions \|series=Wiley–Teubner Series in Computer Sciences \|publisher=[[John Wiley & Sons Ltd.]], and [[B. G. Teubner Verlag]], Stuttgart \|date=1987 \|orig-date=November 1986 \|___location=Frankfurt am Main/Bielefeld, Germany \|isbn=3-519-02107-2<!-- Teubner --> ~~\|id={{ISBN\|0-471-91555-6<!-- Wiley -->\|978-3-519-02107-0}}~~ \|lccn=87-10388}} (xii+457 pages) (NB. At the time an influential textbook on the subject, commonly known as the "Blue Book". Also available for [http://eccc.hpi-web.de/static/books/The_Complexity_of_Boolean_Functions/ download (PDF)] at the [[Electronic Colloquium on Computational Complexity]].) * {{cite web \|title=Lecture notes for a course of Uri Zwick on circuit complexity \|author-first=Uri \|author-last=Zwick \|author-link=Uri Zwick \|url=http://www.cs.tau.ac.il/~zwick/scribe-boolean.html}}

Circuit complexity: Difference between revisions