On the complexity of identifying head-elementary-set-free programs (Q3400962)
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 identifying head-elementary-set-free programs |
scientific article; zbMATH DE number 5663942
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of identifying head-elementary-set-free programs |
scientific article; zbMATH DE number 5663942 |
Statements
On the complexity of identifying head-elementary-set-free programs (English)
0 references
28 January 2010
0 references
computational complexity
0 references
elementary set
0 references
disjunctive logic program
0 references
head-elementary-set-free program
0 references
0.8962119
0 references
0.8299674
0 references
0.8288919
0 references
0 references
0.82240975
0 references
0.8202908
0 references
