Languages that capture complexity classes
| Author(s) : | Neil Immerman, |
| Publisher : | N/A |
| Publication Date : | 1987 |
| ISSN : | N/A |
| Abstract : | We present in this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a property of graphs (respectively groups, binary strings,, |