Encoding invariance in average case complexity (Q1678756): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00224-013-9517-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060628418 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Average-Case Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the theory of average case complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Pseudorandom Generator from any One-way Function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Average Case Complete Problems / rank | |||
Normal rank | |||
Latest revision as of 15:55, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Encoding invariance in average case complexity |
scientific article |
Statements
Encoding invariance in average case complexity (English)
0 references
7 November 2017
0 references
average-case complexity
0 references
polynomial-time samplable distribution
0 references
polynomial-time computable distribution
0 references
