The computational complexity of dominance and consistency in CP-nets (Q3624167)
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: The computational complexity of dominance and consistency in CP-nets |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The computational complexity of dominance and consistency in CP-nets |
scientific article |
Statements
28 April 2009
0 references
0.7852423787117004
0 references
0.765476405620575
0 references
0.7578102350234985
0 references
0.754452109336853
0 references
0.7436835765838623
0 references
