The complexity of \(\mathit{AUTOSAT}(\Sigma^i_m)\) (Q3086725)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5872218
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of \(\mathit{AUTOSAT}(\Sigma^i_m)\) |
scientific article; zbMATH DE number 5872218 |
Statements
30 March 2011
0 references
hardness
0 references
completeness
0 references
relational structures
0 references
polynomial-time reductions
0 references
higher-order logics
0 references
0.7169301509857178
0 references
0.7167397141456604
0 references
0.7163397073745728
0 references
0.7052742838859558
0 references
