Previously the simple DP had both time and space complexity O(n^2) where n is the number of gates. This PR reduces the space complexity to O(n) by doing the DP in reversed order.
Also removed the randomized part in benchmark_dp and added some code for NWQBench.
Previously the simple DP had both time and space complexity O(n^2) where n is the number of gates. This PR reduces the space complexity to O(n) by doing the DP in reversed order.
Also removed the randomized part in benchmark_dp and added some code for NWQBench.