<--- Back to Details
First PageDocument Content
Complexity classes / Circuit complexity / ACC0 / Natural proof / Pseudorandom generator / TC0 / AC0 / Parity function / EXPTIME / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2001-06-15 14:23:26
Complexity classes
Circuit complexity
ACC0
Natural proof
Pseudorandom generator
TC0
AC0
Parity function
EXPTIME
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: ftp.cs.rutgers.edu

Download Document from Source Website

File Size: 213,13 KB

Share Document on Facebook

Similar Documents

Topics in Circuit Complexity (CS354, Fall’11) Week 1: An Overview of Circuit Complexity Lecture Notes for 9/27 and 9/29

DocID: 1t6ph - View Document

Logic / Abstraction / Circuit complexity / NC / Quantifier / Cardinality

Empirical Issues in Syntax and Semantics 8 O. Bonami & P. Cabredo Hofherr (eds, pp. 487–510 http://www.cssp.cnrs.fr/eiss8 Incremental more

DocID: 1rqR0 - View Document

Circuit complexity / NC

JMLR: Workshop and Conference Proceedings vol 49:1–23, 2016 Maximin Action Identification: A New Bandit Framework for Games Aur´elien Garivier AURELIEN . GARIVIER @ MATH . UNIV- TOULOUSE . FR

DocID: 1rjfU - View Document

Circuit complexity / NC / Big O notation / Mathematics / Theoretical computer science / Computer science

Counting in the Presence of Memory Faults Gerth Stølting Brodal1 , Allan Grønlund Jørgensen1 , Gabriel Moruz2,? , and Thomas Mølhave3,?? 1 2

DocID: 1r9zJ - View Document

Logic gates / Mathematics / Mathematical logic / Algebra / Boolean algebra / Logic in computer science / Algebraic logic / Circuit complexity / Canonical normal form / Combinational logic / XOR gate / Digital electronics

CS61c: Representations of Combinational Logic Circuits J. Wawrzynek October 12, 2007 1

DocID: 1r4rE - View Document