Sökning: "Oliver Kullmann"
Hittade 1 avhandling innehållade orden Oliver Kullmann.
1. Algorithms, measures and upper bounds for satisfiability and related problems
Sammanfattning : The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of attention, particularly with the focus of producing algorithms with stronger theoretical guarantees, e.g. upper bounds on the running time on the form O(c^n) for some c. LÄS MER
Resultatsidor:
1