#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2015

2017

- This year (2)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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 (tight) upper bound of 2 O(n) on the size of nondeterministic finite automata (NFAs) representing the subword closure of a CFG of size n. (2) We present a family of CFGs for which… (More)

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. However, this fact requires a number of voters that is almost linear in the number of alternatives. It is therefore unclear whether these results remain intact when the number of… (More)

- Christian Fluri, Georg Bachmeier, Darya Melnyk
- 2017

In this semester thesis, the goal was to fully understand the RAFT algorithm and then to examine its functionality and robustness in a critical point of view. With our own implementation of RAFT in Python we tried to get more familiar with the algorithm and also got a tool to test the algorithm under many different conditions. Especially we tried to measure… (More)

- Georg Bachmeier, Felix Brandt, +4 authors Hans Georg Seedig
- ArXiv
- 2017

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. However, this fact requires a number of voters that is almost linear in the number of alternatives. It is therefore unclear whether these results remain intact when the number of… (More)

- ‹
- 1
- ›