A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph (Q3544243)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph |
scientific article; zbMATH DE number 5378727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph |
scientific article; zbMATH DE number 5378727 |
Statements
A Worst-Case Analysis of the Sequential Method to List the Minimal Hitting Sets of a Hypergraph (English)
0 references
5 December 2008
0 references
hypergraph
0 references
minimal hitting set
0 references
listing algorithms
0 references
sequential method
0 references
read-once Boolean functions
0 references
0.7689968347549438
0 references
0.7624492049217224
0 references
0.7589932680130005
0 references
0.7554900050163269
0 references
