. . "En informatique th\u00E9orique, plus pr\u00E9cis\u00E9ment en th\u00E9orie de la complexit\u00E9, le th\u00E9or\u00E8me de Sipser-G\u00E1cs-Lautemann (ou th\u00E9or\u00E8me de Sipser-Lautemann ou de Sipser-G\u00E1cs) est le th\u00E9or\u00E8me qui \u00E9nonce que la classe probabiliste BPP (bounded-error probabilistic polynomial time) est incluse dans la hi\u00E9rarchie polynomiale. Cette relation d'inclusion est surprenante[Selon qui ?] car la d\u00E9finition de la hi\u00E9rarchie polynomiale ne fait pas r\u00E9f\u00E9rence \u00E0 la th\u00E9orie des probabilit\u00E9s."@fr . "Th\u00E9or\u00E8me de Sipser-G\u00E1cs-Lautemann"@fr . "P"@en . . . . . . "En informatique th\u00E9orique, plus pr\u00E9cis\u00E9ment en th\u00E9orie de la complexit\u00E9, le th\u00E9or\u00E8me de Sipser-G\u00E1cs-Lautemann (ou th\u00E9or\u00E8me de Sipser-Lautemann ou de Sipser-G\u00E1cs) est le th\u00E9or\u00E8me qui \u00E9nonce que la classe probabiliste BPP (bounded-error probabilistic polynomial time) est incluse dans la hi\u00E9rarchie polynomiale. Cette relation d'inclusion est surprenante[Selon qui ?] car la d\u00E9finition de la hi\u00E9rarchie polynomiale ne fait pas r\u00E9f\u00E9rence \u00E0 la th\u00E9orie des probabilit\u00E9s."@fr . . . "2"^^ . "1077984028"^^ . "Teorema de Sipser\u2013Lautemann"@pt . . . . . . "In computational complexity theory, the Sipser\u2013Lautemann theorem or Sipser\u2013G\u00E1cs\u2013Lautemann theorem states that bounded-error probabilistic polynomial (BPP) time is contained in the polynomial time hierarchy, and more specifically \u03A32 \u2229 \u03A02. In 1983, Michael Sipser showed that BPP is contained in the polynomial time hierarchy. showed that BPP is actually contained in \u03A32 \u2229 \u03A02. contributed by giving a simple proof of BPP\u2019s membership in \u03A32 \u2229 \u03A02, also in 1983. It is conjectured that in fact BPP=P, which is a much stronger statement than the Sipser\u2013Lautemann theorem."@en . . . . . . "Sipser\u2013Lautemann theorem"@en . . . "Em teoria da complexidade computacional, o teorema Sipser-Lautemann ou teorema Sipser-G\u00E1cs-Lautemann estabelece que Bounded-error probabilistic polinomial time (BPP), est\u00E1 contida na hierarquia de tempo polinomial, e, mais especificamente, em \u03A32 \u2229 \u03A02. Em 1983, Michael Sipser mostrou que BPP est\u00E1 contida na hierarquia de tempo polinomial. mostrou que BPP est\u00E1 atualmente inserida em \u03A32 \u2229 \u03A02. contribuiu dando uma prova simples de que BPP est\u00E1 contida em \u03A32 \u2229 \u03A02, tamb\u00E9m em 1983. Conjectura-se que, na realidade, BPP = P, que \u00E9 uma afirma\u00E7\u00E3o mais forte do que o teorema de Sipser-Lautemann."@pt . "Em teoria da complexidade computacional, o teorema Sipser-Lautemann ou teorema Sipser-G\u00E1cs-Lautemann estabelece que Bounded-error probabilistic polinomial time (BPP), est\u00E1 contida na hierarquia de tempo polinomial, e, mais especificamente, em \u03A32 \u2229 \u03A02. Em 1983, Michael Sipser mostrou que BPP est\u00E1 contida na hierarquia de tempo polinomial. mostrou que BPP est\u00E1 atualmente inserida em \u03A32 \u2229 \u03A02. contribuiu dando uma prova simples de que BPP est\u00E1 contida em \u03A32 \u2229 \u03A02, tamb\u00E9m em 1983. Conjectura-se que, na realidade, BPP = P, que \u00E9 uma afirma\u00E7\u00E3o mais forte do que o teorema de Sipser-Lautemann."@pt . . "6261"^^ . . "2921620"^^ . . . . . . "In computational complexity theory, the Sipser\u2013Lautemann theorem or Sipser\u2013G\u00E1cs\u2013Lautemann theorem states that bounded-error probabilistic polynomial (BPP) time is contained in the polynomial time hierarchy, and more specifically \u03A32 \u2229 \u03A02. In 1983, Michael Sipser showed that BPP is contained in the polynomial time hierarchy. showed that BPP is actually contained in \u03A32 \u2229 \u03A02. contributed by giving a simple proof of BPP\u2019s membership in \u03A32 \u2229 \u03A02, also in 1983. It is conjectured that in fact BPP=P, which is a much stronger statement than the Sipser\u2013Lautemann theorem."@en . . . . . . . .