The structure of generalized complexity cores (Q1115611): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:30, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The structure of generalized complexity cores |
scientific article |
Statements
The structure of generalized complexity cores (English)
0 references
1988
0 references
Structural properties of computational complexity cores are studied. It is shown that every set A has a proper hard core with respect to any countable class C which is closed under finite union and under finite variation. Similar results for C-levelable sets are obtained. The results presented in this paper are straightforward generalizations of results obtained by other authors for the special case \(C=polynomial\) time.
0 references
structural complexity
0 references
levelability
0 references
complexity cores
0 references
