Complete sets and closeness to complexity classes (Q4727430)
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 4001484
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complete sets and closeness to complexity classes |
scientific article; zbMATH DE number 4001484 |
Statements
Complete sets and closeness to complexity classes (English)
0 references
1986
0 references
polynomial time
0 references
binary strings
0 references
polynomially close
0 references
Boolean closure
0 references
sparse sets
0 references
0 references
0.8500838875770569
0 references
0.8168992400169373
0 references
0.8094263076782227
0 references
0.8065330386161804
0 references
