Given the FFT, we can have a ______ time procedure for multiplying two polynomials A(x) and B(x) of degree bound n, where input and output representations are in coefficient form, assuming n is a power of 2.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. O(n log2 n)
Explanation
Evaluate both by FFT, multiply pointwise and interpolate by inverse FFT: Θ(n log n).More Data Structures and Algorithms questions
- Circuit satisfiability problem: given a Boolean combinational circuit composed of AND, OR and NOT gates, is it satisfiable? A one-output Bo…
- Given the expression (A + B * D) / (E − F) + G: 1. The prefix notation is + / + A * D B − E F G 2. The prefix expression is the reverse of…
- Match List I with List II. Choose the correct answer from the options given below:List I List II a. Dijkstra's algorithm I. Calculates path…
- For the weighted graph below, which of the following orders of adding edges can NOT be produced by a minimum spanning tree algorithm? Edges…
- Statement I: Given a graph G = (V, E) in which each vertex v ∈ V has an associated positive weight w(v), we can use linear programming to f…
- Assume that f(n), g(n) and h(n) are asymptotically positive. Which of the following is correct?