#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2003

2005

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Birgit Schelm
- Electronic Colloquium on Computational Complexity
- 2003

- Birgit Schelm
- 2004

This thesis combines average-case complexity theory with the approximability of optimisation problems. Both are ways of dealing with the fact that many computational problems are not solvable in polynomial time, unless P = NP. A theoretical framework is established that allows both the classification of optimisation problems with respect to their… (More)

- Arfst Nickelsen, Birgit Schelm
- 20th Annual IEEE Conference on Computational…
- 2005

We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP (Levin, 1984) has been characterized by Impagliazzo (1995) using polynomial-time algorithm schemes with benign faults. The class HP extends AvgP by allowing malign faults instead of benign faults. The class… (More)

- Birgit Schelm
- Theory of Computing Systems
- 2005

Both average-case complexity and the study of the approximability of NP optimisation problems are well established and active fields of research. Many results concerning the average behaviour of approximation algorithms for NP optimisation problems exist, both with respect to their running time and their performance ratio, but a theoretical framework to… (More)

- ‹
- 1
- ›