in Programming in C recategorized by
2,990 views
3 votes
3 votes

The upper bound of computing time of m colouring decision problem is

  1. $O(nm)$
  2. $O(n^m)$
  3. $O(nm^n)$
  4. $O(n^mm^n)$
in Programming in C recategorized by
3.0k views

2 Answers

0 votes
0 votes
0 votes
0 votes
Answer:

Related questions

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