Author:
Sumita Hanna,Kakimura Naonori,Makino Kazuhisa
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference27 articles.
1. Arvind, V., Köbler, J., Kuhnert, S., Torán, J.: Solving linear equations parameterized by Hamming weight. Algorithmica 75(2), 322–338 (2016)
2. Björklund, H., Svensson, O., Vorobyov, S.: Linear complementarity algorithms for mean payoff games. Technical Report 2005-05, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science (2005)
3. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75, 423–434 (2009)
4. Chen, X., Deng, X., Teng, S.: Sparse games are hard. In: Spirakis, P., Mavronicolas, M., Kontogiannis, S. (eds.) Internet and Network Economics: Second International Workshop, WINE 2006, Patras, Greece, December 15–17, pp. 262–273. Springer, Berlin, Heidelberg (2006)
5. Chen, X., Deng, X., Teng, S.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56, 14:1–14:57 (2009)