A lower bound to palindrome recognition by probabilistic Turing machines

Authors:
Andrew C Yao
Affiliations:
-
Venue:
A lower bound to palindrome recognition by probabilistic Turing machines
Year:
1977

Citing 0
Cited 3

A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor

Journal of the ACM (JACM)
A note on probabilistically verifying integer and polynomial products

Journal of the ACM (JACM)
Note on probabilistic algorithms in integer and polynomial arithmetic

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We call attention to the problem of proving lower bounds on probabilistic Turing machine computations. It is shown that any probabilisitc Turing machine recognizing the language L = {w $\phi$ w | w $\epsilon$ ${{0,1}}^*$} with error $\lambda$ 1/2 must take $\Omega$(n log n) time.