The complexity of combinatorial problems with succinct input representation
- Cite this article as:
- Wagner, K.W. Acta Informatica (1986) 23: 325. doi:10.1007/BF00289117
- 224 Downloads
Several languages for the succinct representation of the instances of combinatorial problems are investigated. These languages have been introduced in [20, 2] and  where it has been shown that describing the instances by these languages causes a blow-up of the complexities of some problems. In the present paper the descriptional power of these languages is compared by estimating the complexities of some combinatorial problems in terms of completeness in suitable classes of the “counting polynomial-time hierarchy” which is introduced here. It turns out that some of the languages are not comparable, unless P=NP Some problems left open in  are solved.