7.1 N P-complete problems cannot be sparse

So in order to be able to even read such a reply, we have to consider as ‘polynomial’ a running time bound that depends on both n and |ψ|.. The former being an integer and the latter

Log-cost model: each instruction costs Θ(k) time, where k is the number of bits of the operands. Typical instruction set:. load, store, goto, branch on zero, add, subtract,

Argue that any NTM can be converted, possibly with a linear slow-down, into an equiva- lent one having at most two possible successor configurations in each

Construct (and prove correctness of) an explicit polynomial-time reduction ILP4 p D IOPHANT. ). b) Prove that the following greedy algorithm produces an approximation of

Carsten R¨osnick Solutions to be submitted by 8.12.2011 14h25.

What is its

Prove: In every circuit of polynomial (why?) size, these gates can be replaced by their binary counterparts while the size grows at most by a constant factor and depth by at most

BubbleSort: O(n²) comparisons and copy instr.s QuickSort: typically O(n·log n) steps.. but O(n²) in