## VARDI , On monadic NP versus monadic co - NP

- N IMMERMAN
- Information and Computation
- 1995

@inproceedings{Barth2001ComparingTP, title={Comparing the Power of Games on Graphs}, author={Johann Ambrosius Barth}, year={2001} }

- Published 2001

The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descriptive complexity is to make use of games on graphs played between two players, called the spoiler and the duplicator. There are two types of these games, which differ in the order in… CONTINUE READING

### Presentations referencing similar topics