A Note on Some Languages in Uniform ACC0

@article{Barrington1991ANO,
  title={A Note on Some Languages in Uniform ACC0},
  author={David A. Mix Barrington and James C. Corbett},
  journal={Theor. Comput. Sci.},
  year={1991},
  volume={78},
  pages={357-362}
}
`ACC'' IS THE CLASS OF LANGUAGES RECOGNIZED BY CIRCUIT FAMILIES WITH POLYNOMIAL SIZE, CONSTANT DEPTH, AND UNBOUNDED FAN-IN, WHERE GATES MAY CALCULATE THE `AND'', `OR'', OR `MOD C'' FUNCTION FOR CONSTANT `C''. ROBUST UNIFORMITY DEFINITIONS FOR `ACC'' AND RELATED CLASSES WERE GIVEN BY BARRINGTON, IMMERMAN, AND STRAUBING [3]. HERE WE SHOW THAT UNIFORM `ACC'' CONTAINS ALL SEMI-LINEAR OR RATIONAL SETS OF INTEGER VECTORS, USING BINARY NOTATION (SHARPENING A RESULT OF IBARRA, JIANG, RAVIKUMAR, AND… CONTINUE READING
BETA

Topics from this paper.

Citations

Publications citing this paper.

Similar Papers