Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Theoretische Informatik"”.
-
Complexity and Partitions
Computational complexity theory usually investigates the complexity of sets, i.e., the complexity of partitions into two parts. But often it is more appropriate to represent natural problems by partitions into more than two parts. A particularly interesting class of such problems consists of …
-
The Forbidden Pattern Approach to Concatenation Hierarchies
The thesis looks at the question asking for the computability of the dot-depth of star-free regular languages. Here one has to determine for a given star-free regular language the minimal number of alternations between concatenation on one hand, and intersection, union, complement on the other …
-
Intuitive algorithms
Assuming that P does not equal NP, which is widely believed to be true, many important computational problems are not solvable in polynomial time. However, this does not imply that NP-hard problems are not exactly solvable at all. Both the concepts of moderately exponential time algorithms and …
-
Free-boundary problem of crack dynamics: phase field modeling
This thesis describes the behavior of cracks and pores under the influence of elastic and curvature effects. In a continuum theory approach, these structure deformations are treated as free moving boundaries. Our investigation start with well established sharp interface equations for which no fully …
-
Forbidden-Patterns and Word Extensions for Concatenation Hierarchies
Starfree regular languages can be build up from alphabet letters by using only Boolean operations and concatenation. The complexity of these languages can be measured with the so-called dot-depth. This measure leads to concatenation hierarchies like the dot-depth hierarchy (DDH) and the closely …