The complexity of recognizing the preservation of some sets by multivalued functions represented by polynomials (Q763511)
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 complexity of recognizing the preservation of some sets by multivalued functions represented by polynomials |
scientific article; zbMATH DE number 6013716
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of recognizing the preservation of some sets by multivalued functions represented by polynomials |
scientific article; zbMATH DE number 6013716 |
Statements
The complexity of recognizing the preservation of some sets by multivalued functions represented by polynomials (English)
0 references
12 March 2012
0 references
multivalued logic function
0 references
polynomial algorithm
0 references
polynomial modulo \(k\)
0 references
0.8316447734832764
0 references
0.8146055936813354
0 references
0.8119921684265137
0 references
