Hardness of sparse sets and minimal circuit size problem (Q2019493): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3082776702 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5111269 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The minimum oracle circuit size problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5121893 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5111137 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5368752 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the NP-Completeness of the Minimum Circuit Size Problem. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Weak lower bounds on resource-bounded compression imply strong separations of complexity classes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5368903 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hardness magnification near state-of-the-art lower bounds / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A low and a high hierarchy within NP / rank | |||
Normal rank | |||
Latest revision as of 01:00, 25 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of sparse sets and minimal circuit size problem |
scientific article |
Statements
Hardness of sparse sets and minimal circuit size problem (English)
0 references
21 April 2021
0 references
MCSP
0 references
sparse sets
0 references
magnification
0 references
reductions
0 references
0 references
