LCC   1994 International Workshop on Logic and Computational Complexity
Wall of Fame | Most Viewed LCC-1994 Paper
248views Algorithms» more  LCC 1994»
10 years 10 months ago
Comparing the Power of Monadic NP Games
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 descripti...
Ronald Fagin
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source248
2Download preprint from source214
3Download preprint from source213
4Download preprint from source209
5Download preprint from source200
6Download preprint from source193