Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$ (Q2971138): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3101446907 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59482299 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1608.02374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear advantage for exact quantum algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separations in Query Complexity Based on Pointer Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Quantum Query Complexity of EXACT and THRESHOLD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithms revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid solution of problems by quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials with two values / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum-of-squares degree of symmetric quadratic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact quantum query complexity / rank
 
Normal rank

Latest revision as of 15:48, 13 July 2024

scientific article
Language Label Description Also known as
English
Exact Quantum Query Complexity of $$\text {EXACT}_{k,l}^n$$
scientific article

    Statements