The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396)
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 2168186
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of homomorphisms and renamings for minimal unsatisfiable formulas |
scientific article; zbMATH DE number 2168186 |
Statements
The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (English)
0 references
13 May 2005
0 references
complexity
0 references
renaming
0 references
homomorphism
0 references
minimal unsatisfiable formula
0 references
graph isomorphism
0 references
0 references
0 references
0.9093044
0 references
0.9034694
0 references
0.8921596
0 references
0.88335454
0 references
0.88209903
0 references
0.87593234
0 references
0.87530816
0 references
0.87469774
0 references
0.87452406
0 references
