View source for Brute force ( The Set-Covering Problem)

← Brute force ( The Set-Covering Problem)

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== Time Complexity == 

$O(U {2}^n)$

== Space Complexity == 

$O(U)$ words

()

== Description == 



== Approximate? == 

Exact

== Randomized? == 

No, deterministic

== Model of Computation == 

Word RAM

== Year == 

1972

== Reference ==

Return to Brute force ( The Set-Covering Problem).

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Brute_force_(_The_Set-Covering_Problem)"

Navigation menu