#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2015

2017

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the state-complexity of representing subor superword closures of context-free grammars (CFGs): (1) We prove a (tight) upper bound of 2O(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 the… (More)

The exam lasts 120 minutes, and there is a total of 120 points. The maximal number of points for each question is indicated in parentheses. Your answers must be in English. Be sure to always justify your answers. Algorithms can be specified in high-level pseudocode or as a verbal description. You do not need to give every last detail, but the main aspects… (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)

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
- ›