12 Results for (keywords_en:COMPLEXITY CLASSES)

Subscribe to RSS feed for this result set

1. Generalized Galois theory and its application to complexity

Engeler, Erwin (1978)


Reports

2. Ein Einblick in die Theorie der Berechnungen

Wiedmer, Edwin, Zachos, Efstathios and Engeler, Erwin (1974)


Reports

3. Reoptimization of NP-hard problems

Zych, Anna (2012)


Doctoral and Habilitation Theses

4. Singularities make spatial join scheduling hard

Neyer, Gabriele and Widmayer, Peter (1997)


Reports

5. Descriptional and computational complexity in relation to the practicability of computation and computational modes

Kupke, Joachim (2006)


Doctoral and Habilitation Theses

6. Toward feasible solutions of NP-complete problems

Lieberherr, Karl (1975)


Reports

7. Complexity classes of finite automata

Královič, Richard (2010)


Doctoral and Habilitation Theses

8. Algorithms and complexity for some machine scheduling and prefetching problems

Weber, Birgitta (2005)


Doctoral and Habilitation Theses

9. Monte Carlo-docking of polypeptide chains

Caflisch, Amedeo (1991)


Doctoral and Habilitation Theses

10. Computational complexity and scheduling algorithms for wireless networks

Goussevskaia, Olga (2009)


Doctoral and Habilitation Theses

11. Exploring the computational limits of large exhaustive search problems

Lincke, Thomas Robert (2002)


Doctoral and Habilitation Theses

12. GraphBench

Brändle, Markus Andreas (2006)


Doctoral and Habilitation Theses