Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games

N. Variyam Vinodchandran. Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games. Int. J. Found. Comput. Sci., 16(6):1297-1308, 2005. [doi]

Abstract

Abstract is missing.