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 1 of 1 for “"Exakte Algorithmen"”.

  1. Exact algorithms based on specific complexity measures for hard problems

    At present, most of the important computational problems - be they decision, search, or optimization problems - are known to satisfy one of the following two criteria:(1) The problem can be solved in polynomial time with respect to the input size n, where the degree of the polynomial is small …

    aachen Repository record for Exact algorithms based on specific complexity measures for hard problems (opens in a new tab)