First Page | Document Content | |
---|---|---|
Date: 2002-06-10 12:16:49Circuit complexity FO ACC0 AC0 DLOGTIME BIT predicate Computational complexity theory AC TC0 Theoretical computer science Applied mathematics Complexity classes | Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication William Hesse1Add to Reading ListSource URL: ftp.cs.rutgers.eduDownload Document from Source WebsiteFile Size: 356,95 KBShare Document on Facebook |
Comput. complex), 1 – 010001–20 $ 1.50c Birkh¨ auser Verlag, Basel 1999DocID: 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-16DocID: 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 1DocID: 1mrFk - View Document |