Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q124819395, #quickstatements; #temporary_batch_1722205759638 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00037-023-00238-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3082917772 / rank | |||
Normal rank | |||
Revision as of 09:28, 30 July 2024
scientific article; zbMATH DE number 7709620
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? |
scientific article; zbMATH DE number 7709620 |
Statements
Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (English)
0 references
10 July 2023
0 references
average-case complexity
0 references
Yao's XOR lemma
0 references
black-box reductions
0 references
