<--- Back to Details
First PageDocument Content
Circuit complexity / FO / ACC0 / AC0 / DLOGTIME / BIT predicate / Computational complexity theory / AC / TC0 / Theoretical computer science / Applied mathematics / Complexity classes
Date: 2002-06-10 12:16:49
Circuit 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 Hesse1

Add to Reading List

Source URL: ftp.cs.rutgers.edu

Download Document from Source Website

File Size: 356,95 KB

Share Document on Facebook

Similar Documents

Comput. complex), 1 – 010001–20 $ 1.50c Birkh¨ 
 auser Verlag, Basel 1999

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.

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

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 †

On Derandomization and Average-Case Complexity of Monotone Functions ∗ George Karakostas †

DocID: 1mHsj - View Document

LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES 1

LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES 1

DocID: 1mrFk - View Document