finding the index of first zero entry in a binary string:
Input: binary string ($0$'s and $1$'s)
Output: index of first zero entry
Can you give a circuit for finding the index of first zero entry in a binary string with minimum depth and polynomial many processors?
1) Is this problem in $AC_0$?
2) Is this problem in $NC_1$?
Can point me at references?
