The Gateway to Computer Science Excellence
0 votes
We can extend our notation to the case of two parameters $n$ and $m$ that can go to infinity independently at different rates.For a given function $g(n,m)$, we denote by $O(g(n,m))$ the set of functions

$O(g(n,m))$ $=$ {$f(n,m) :$ there exist positive constants $c,n_0,$ and $m_0$ such that $0 \leq f(n,m)  \leq cg(n,m)$ for all $n \geq n_0$ or $m \geq m_0$ }

Give corresponding definitions for $\Omega(g(n,m))$ and $\Theta(g(n,m))$.
in Algorithms by Boss (42.7k points) | 23 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,834 questions
57,804 answers
108,243 users