Now showing items 1-1 of 1

• #### Exact algorithms for MAX-2SAT and MAX-3SAT via multidimensional matrix multiplication ﻿

(The University of Bergen, 2015-06-01)
In this thesis it is showed how an $O(n^{4-\epsilon})$ algorithm for the cube multiplication problem (that is defined in the thesis) would imply a faster than naive $O^{*}(2^{n(1-\frac{\epsilon}{4})})$ algorithm for the ...
Master thesis