Author:
Rey Anja,Rothe Jörg,Schadrack Hilmar,Schend Lena
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference37 articles.
1. Aziz, H., Brandt, F., Seedig, H.: Computing desirable partitions in additively separable hedonic games. Artif. Intell. 195, 316–334 (2013)
2. Baumeister, D., Brandt, F., Fischer, F., Hoffmann, J., Rothe, J.: The complexity of computing minimal unidirectional covering sets. Theory of Computing Systems 53(3), 467–502 (2013)
3. Beigel, R.: Bounded queries to SAT and the boolean hierarchy. Theor. Comput. Sci. 84(2), 199–223 (1991)
4. Beigel, R., Hemachandra, L., Wechsung, G.: On the power of probabilistic polynomial time: P NP [ log ] ⊆ PP $\mathrm {P^{NP[log]}}\subseteq PP$ . In: Proceedings of the 4th Structure in Complexity Theory Conference, pp 225–227. IEEE Computer Society Press, June (1989)
5. Brams, S., Fishburn, P. In: Arrow, K., Sen, A., Suzumura, K. (eds.) : Handbook of Social Choice and Welfare, volume 1, pages 173–236. North-Holland (2002)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献