On algorithms for construction of all irreducible partial covers (Q2379946)
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: On algorithms for construction of all irreducible partial covers |
scientific article; zbMATH DE number 5686393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On algorithms for construction of all irreducible partial covers |
scientific article; zbMATH DE number 5686393 |
Statements
On algorithms for construction of all irreducible partial covers (English)
0 references
24 March 2010
0 references
irreducible partial cover
0 references
totally polynomial algorithm
0 references
computational complexity
0 references
0 references
0.7550074458122253
0 references
0.7523915767669678
0 references
0.7488964796066284
0 references
0.7442737221717834
0 references
