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...
| Publicat a: | SIAM journal on computing. 26, 3 (1997). |
|---|---|
| Autor principal: | |
| Format: | Article |
| Idioma: | English |
| Matèries: |