Quantum lower bounds for the Goldreich-Levin problem (Q1045938): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Mark R. A. Adcock / rank | |||
Property / author | |||
Property / author: Raymond H. Putra / rank | |||
Property / author | |||
Property / author: Mark R. A. Adcock / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Raymond H. Putra / rank | |||
Normal rank | |||
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.1016/j.ipl.2005.01.016 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2095275555 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4736850 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4819589 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Quantum Complexity Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modern cryptography, probabilistic proofs and pseudo-randomness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4228473 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: One way functions and pseudorandom generators / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:18, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Quantum lower bounds for the Goldreich-Levin problem |
scientific article |
Statements
Quantum lower bounds for the Goldreich-Levin problem (English)
0 references
18 December 2009
0 references
computational complexity
0 references
quantum computing
0 references
cryptography
0 references