Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737)
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: Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory |
scientific article; zbMATH DE number 6522390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory |
scientific article; zbMATH DE number 6522390 |
Statements
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (English)
0 references
18 December 2015
0 references
abstract dialectical frameworks
0 references
computational complexity
0 references
approximation fixpoint theory
0 references
0 references
0 references
0 references
0 references
0.8234918713569641
0 references
0.7990325093269348
0 references
0.7653173804283142
0 references
0.7573794722557068
0 references
