An introduction to NP-completeness in fuzzy context (Q4962804)
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 6972983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An introduction to NP-completeness in fuzzy context |
scientific article; zbMATH DE number 6972983 |
Statements
5 November 2018
0 references
polynomial time
0 references
deterministic algorithm
0 references
nondeterministic algorithm
0 references
P
0 references
NP
0 references
NP-completeness
0 references
NP-hardness
0 references
fuzzy sets
0 references
fuzzy operations
0 references
fuzzy algorithm
0 references
fuzzy Turing machine
0 references
0.7468067407608032
0 references
0.7438132762908936
0 references
