Complexity classes defined via k-valued functions
A lot of complexity classes can be characterized by posing some global acceptance condition on the computation trees produced by nondeterministic polynomial time machines. If the acceptance condition can be performed by a tree automaton, we obtain the concept of locally definable acceptance types (U...
Saved in:
| Published in: | Proceedings - Structure in Complexity Theory Conference pp. 224 - 234 |
|---|---|
| Main Author: | |
| Format: | Conference Proceeding Journal Article |
| Language: | English |
| Published: |
IEEE Comput. Soc. Press
1994
|
| Subjects: | |
| ISBN: | 0818656700, 9780818656705, 9780818656729, 0818656727 |
| ISSN: | 1063-6870 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!