Complexity class   (translated from German)
Complexity class One Complexity class is in that Komplexitaetstheorie a category of ... math> (length of the input). If from complexity the speech is general, usually the ...
http://de.wikipedia.org/wiki/Komplexitätsklasse - 7k - Cached (German) - Wikipedia (German) - Similar pages

Complexity class
Complexity class In computational complexity theory, a complexity class is a set of problems of ...
http://en.wikipedia.org/wiki/Complexity_class - 5k - Cached - Similar pages

NP (complexity class)   (translated from German)
NP (complexity class) The term NP (of englisch Non deterministic ... compared. NP becomes occasional erroneously as the class that nicht in Polynomialzeit solvable problems designation ... NP. Many problems, which lie in the complexity class NP, in particular those NP-COMPLETE, ...
http://de.wikipedia.org/wiki/NP_(Komplexitätsklasse) - 6k - Cached (German) - Wikipedia (German) - Similar pages

ZPP (complexity class)   (translated from German)
ZPP (complexity class) Those Complexity class ZPP or ZPP($\backslash epsilon$(n ...
http://de.wikipedia.org/wiki/ZPP_(Komplexitätsklasse) - 2k - Cached (German) - Wikipedia (German) - Similar pages

PP (complexity class)   (translated from German)
PP (complexity class) In that Complexity theory is PP the class of the decisions in of a probabilistic ... and it now work on! Important one Complexity classes ( further ) BPP | BQP | E | EXPTIME | ...
http://de.wikipedia.org/wiki/PP_(Komplexitätsklasse) - 1k - Cached (German) - Wikipedia (German) - Similar pages

Q (complexity class)   (translated from German)
Q (complexity class) The class $\backslash mathbf\{Q\}$ also admits under ... is that Theoretical computer science , particularly that Complexity theory . They represent a complexity class, with not-deterministic Turing machines ...
http://de.wikipedia.org/wiki/Q_(Komplexitätsklasse) - 2k - Cached (German) - Wikipedia (German) - Similar pages

LOGCFL (complexity class)   (translated from German)
LOGCFL (complexity class) The class LOGCFL can most simply as conclusion under ... Literature Ivan H. Sudburough: On the Tape Complexity OF Context Free LANGUAGES. Journal OF the ...
http://de.wikipedia.org/wiki/LOGCFL_(Komplexitätsklasse) - 1k - Cached (German) - Wikipedia (German) - Similar pages

RP (complexity class)   (translated from German)
RP (complexity class) RP (random polynominal) and/or. RP($\backslash epsilon$(n)) marks the class of the decision problems, for it gives ... bilateral error (two sided error) with the complexity class BPP . One turns into from the ...
http://de.wikipedia.org/wiki/RP_(Komplexitätsklasse) - 1k - Cached (German) - Wikipedia (German) - Similar pages

NL (complexity class)   (translated from German)
NL (complexity class) In that Complexity theory designated NL those Class that Decision problems , of one not-deterministic ... can. NL is an extension of the class L , similar for deterministic Turing machines ...
http://de.wikipedia.org/wiki/NL_(Komplexitätsklasse) - 4k - Cached (German) - Wikipedia (German) - Similar pages

L (complexity class)   (translated from German)
L (complexity class) In that Complexity theory designated L those Class that Decision problems , of one deterministic Turing ... can. Table of contents Relationship with other complexity classes The following relations is well- ...
http://de.wikipedia.org/wiki/L_(Komplexitätsklasse) - 2k - Cached (German) - Wikipedia (German) - Similar pages