Sciweavers

LCC
1994
248views Algorithms» more  LCC 1994»
14 years 3 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