NP-hard sets are superterse unless NP is small (Q290182): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03D30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6588275 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computational complexity | |||
Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
P-selective set | |||
Property / zbMATH Keywords: P-selective set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
p-measure | |||
Property / zbMATH Keywords: p-measure / rank | |||
Normal rank |
Revision as of 19:36, 27 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | NP-hard sets are superterse unless NP is small |
scientific article |
Statements
NP-hard sets are superterse unless NP is small (English)
0 references
1 June 2016
0 references
computational complexity
0 references
P-selective set
0 references
p-measure
0 references