On the Amount of Nondeterminism and the Power of Verifying Academic Article uri icon


  • The relationship between nondeterminism and other computational resources is investigated based on the "guess-then-check" model GC. Systematic techniques are developed to construct natural complete languages for the classes defined by this model. This improves a number of previous results in the study of limited nondeterminism. Connections of the model GC to computational optimization problems are exhibited.

published proceedings

  • SIAM Journal on Computing

altmetric score

  • 2.5

author list (cited authors)

  • Cai, L., & Chen, J.

citation count

  • 29

complete list of authors

  • Cai, Liming||Chen, Jianer

publication date

  • June 1997