9786131257681 - RL (Complexity): Computational Complexity Theory, Complexity Class, Logarithmic Space, Polynomial Time, Probabilistic Turing Machine (4 resultados)

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 72 pp. Englisch.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.

Taschenbuch. Condición: Neu. RL (Complexity) | Computational Complexity Theory, Complexity Class, Logarithmic Space, Polynomial Time, Probabilistic Turing Machine | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131257681 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -High Quality Content by WIKIPEDIA articles! In computational complexitytheory, RL (Randomized Logarithmic-space), sometimes called RLP(Randomized Logarithmic-space Polynomial-time), is the complexity classof problems solvable in logarithmic space and polynomial time withprobabilistic Turing machines with one-sided error. It is named inanalogy with RP, which is similar but has no logarithmic spacerestriction. The probabilistic Turing machines in the definition of RLnever accept incorrectly but are allowed to reject incorrectly less than1/3 of the time; this is called one-sided error. The constant 1/3 isarbitrary; any x with 0 ¿ xVDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 72 pp. Englisch.