<--- 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

Computational complexity theory / Complexity classes / Theory of computation / FO / PSPACE / SO / P / EXPTIME / Boolean algebra / Co-NP-complete / Reduction / Descriptive complexity theory

Introduction & Motivation Relations and Operations Boolean and 3-element cases

DocID: 1qCnb - View Document

Automated theorem proving / Method of analytic tableaux

An ExpTime Tableau Method for Dealing with Nominals and Quantified Number Restrictions in Deciding the Description Logic SHOQ Linh Anh Nguyen1,2 and Joanna Goli´ nska-Pilarek3 1

DocID: 1mxoK - View Document

Complexity classes / Theory of computation / Theoretical computer science / Mathematics / FO / PSPACE / P / Recursion / EXPTIME / Low

PDF Document

DocID: 1iFYu - View Document

Deciding k CFA is complete for EXPTIME ∗ David Van Horn Harry G. Mairson Brandeis University

DocID: 1eiBE - View Document

Applied mathematics / P / EXPTIME / EXPSPACE / L / FO / 2-EXPTIME / Theoretical computer science / Computational complexity theory / Complexity classes

Lecture 5: Introduction to Complexity TheoryComplexity Theory

DocID: 1b02D - View Document