Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference23 articles.
1. Alon, N.: Covering graphs by the minimum number of equivalence relations. Combinatorica 6(3), 201–206 (1986). doi:
10.1007/BF02579381
2. Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity theory Proceedings of the 27th Annual Symposium on Foundations of Computer Science, SFCS’86, pp 337–347. IEEE Computer Society, Washington (1986), doi:
10.1109/SFCS.1986.15
3. Balcázar, J.L., Lozano, A., Torán, J.: The complexity of algorithmic problems on succinct instances. Computer Science, Research and Applications, pp 351–377. Springer, US (1992)
4. Chlebík, M., Chlebíková, J.: Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206(11), 1264–1275 (2008). doi:
10.1016/j.ic.2008.07.003
5. Cook, S.A.: A hierarchy for nondeterministic time complexity. J. Comput. Syst. Sci. 7(4), 343–353 (1973). doi:
10.1016/S0022-0000(73)80028-5