1
$\begingroup$

Suppose an algorithm $A$ which, given a graph $G$ on $n$ vertices (represented in, say, adjacency matrix form) and some parameter $C$, runs in time $T = O\bigl(n^2\cdot \sqrt{C}\bigr)$. Is the algorithm taking polynomial time or pseudo polynomial time?

  • 0
    C depends on$n$but I dont know how.2012-11-09

0 Answers 0