On the complexity of enumerating pseudo-intents (Q628340)
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 the complexity of enumerating pseudo-intents |
scientific article; zbMATH DE number 5864323
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of enumerating pseudo-intents |
scientific article; zbMATH DE number 5864323 |
Statements
On the complexity of enumerating pseudo-intents (English)
0 references
10 March 2011
0 references
formal concept analysis
0 references
implications
0 references
Duquenne-Guigues base
0 references
pseudo-intents
0 references
complexity
0 references
0.931879460811615
0 references
0.9003034830093384
0 references
0.8482957482337952
0 references
0.8005446195602417
0 references
0.7814578413963318
0 references
