On the amount of nondeterminism and the power of nondeterminism and the power of verifying.
The relationship between nondeterminsm 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 i...
發表在: | SIAM journal on computing. 26, 3 (1997). |
---|---|
主要作者: | |
格式: | Article |
語言: | English |
主題: |