<--- Back to Details
First PageDocument Content
Applied mathematics / P / EXPTIME / EXPSPACE / L / FO / 2-EXPTIME / Theoretical computer science / Computational complexity theory / Complexity classes
Date: 2014-10-16 13:22:26
Applied mathematics
P
EXPTIME
EXPSPACE
L
FO
2-EXPTIME
Theoretical computer science
Computational complexity theory
Complexity classes

Lecture 5: Introduction to Complexity TheoryComplexity Theory

Add to Reading List

Source URL: www.cs.rice.edu

Download Document from Source Website

File Size: 68,93 KB

Share Document on Facebook

Similar Documents

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

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

Deduction / Rules of inference / Converse / Traditional logic / Entailment / Reachability / Sequent calculus / Implicational propositional calculus / Logic / Propositional calculus / Proof theory

IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE arXiv:1402.0705v2 [cs.LO] 25 Sep[removed]SYLVAIN SCHMITZ

DocID: WUcp - View Document

Applied mathematics / EXPSPACE / 2-EXPTIME / NP / Automated planning and scheduling / EXPTIME / Non-deterministic Turing machine / DSPACE / Alternating Turing machine / Theoretical computer science / Computational complexity theory / Complexity classes

PDF Document

DocID: 1isl - View Document