Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗

First Page		Document Content
Date: 2014-04-01 09:13:02 Complexity classes Circuit complexity Boolean algebra NP-complete problems Time complexity ACC0 Cook–Levin theorem P NC Theoretical computer science Computational complexity theory Applied mathematics		Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗ Add to Reading List Source URL: www.ccs.neu.edu Download Document from Source Website File Size: 260,84 KB Share Document on Facebook

	Comput. complex), 1 – 010001–20 $ 1.50c Birkh¨ auser Verlag, Basel 1999 DocID: 1pKtv - View Document
	Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125. DocID: 1p3R3 - View Document
	DATA UPDATE // JULYNOVEMBER 2012 Index Value as at 30-Jun-16 DocID: 1ounU - View Document
	On Derandomization and Average-Case Complexity of Monotone Functions ∗ George Karakostas † DocID: 1mHsj - View Document
	LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES 1 DocID: 1mrFk - View Document