Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
RL (Complexity)
CHF 37.00
Auf Lager
SKU
SCDK0LSQ1NN
1 Verfügbar 
Geliefert zwischen Do., 29.01.2026 und Fr., 30.01.2026
Details
In computational complexity theory, RL (Randomized Logarithmic-space), sometimes called RLP (Randomized Logarithmic-space Polynomial-time), is the complexity class of problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with one-sided error. It is named in analogy with RP, which is similar but has no logarithmic space restriction. The probabilistic Turing machines in the definition of RL never accept incorrectly but are allowed to reject incorrectly less than 1/3 of the time; this is called one-sided error. The constant 1/3 is arbitrary; any x with 0 x 1/2 would suffice. This error can be made 2 p(x) times smaller for any polynomial p(x) without using more than polynomial time or logarithmic space by running the algorithm repeatedly.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131257681
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131257681
- Format Fachbuch
- Titel RL (Complexity)
- Herausgeber Betascript Publishing
- Anzahl Seiten 72
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
