1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.GT2017
k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters
Georg Bachmeier, Felix Brandt, Christian Geist +4
Many hardness results in computational social choice make use of the fact that every directed graph may be induced as the pairwise majority relation of some preference profile. How…
cs.FL2014★ 1 cited
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity
Georg Bachmeier, Michael Luttenberger, Maximilian Schlund
We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the state-complexity of representing sub- or superword closures of context-free grammars (CFGs): (1) We prove a (t…