Contents Part I The Basics

First Page		Document Content
Date: 2012-03-10 09:16:28 Complexity classes Circuit complexity Natural proof Switching lemma ACC0 NC P Binary decision diagram Clique Theoretical computer science Computational complexity theory Applied mathematics		Contents Part I The Basics Add to Reading List Source URL: www.thi.informatik.uni-frankfurt.de Download Document from Source Website File Size: 97,09 KB Share Document on Facebook

	Chapter 1 Introduction Let f be Boolean function from nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str DocID: 19vsp - View Document
	Almost all decision trees do not allow significant quantum speed-up DocID: 13P5P - View Document
	A Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds YUVAL FILMUS and TONIANN PITASSI, University of Toronto RAHUL SANTHANAM, University of Edinburgh DocID: 13pkI - View Document
	The Ackermann Award 2011 Report of the Jury The seventh Ackermann Award will be presented at this CSL’11, held in Bergen, Norway. This is the ﬁfth year the EACSL Ackermann Award is generously sponsored. Our sponsor f DocID: 11MR1 - View Document
	Contents Part I The Basics DocID: 11BUt - View Document