Time-Space Complexity Advantages for Quantum Computing (Q5055992): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
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/978-3-319-71069-3_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2770686326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separations in query complexity using cheat sheets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way finite automata with quantum and classical states. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense quantum coding and quantum finite automata / 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: Q5368738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Communication vs. Partition Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the distributed Deutsch–Jozsa promise problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and analysis of randomized algorithms. Introduction to design paradigms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quantum and probabilistic communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum time-space tradeoffs for sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hybrid models of quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5418251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Way Finite Automata with Quantum and Classical States / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the state complexity of semi-quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Quantum Query Complexity to State Complexity / rank
 
Normal rank

Latest revision as of 03:03, 31 July 2024

scientific article; zbMATH DE number 7631440
Language Label Description Also known as
English
Time-Space Complexity Advantages for Quantum Computing
scientific article; zbMATH DE number 7631440

    Statements

    Time-Space Complexity Advantages for Quantum Computing (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2022
    0 references
    quantum computing
    0 references
    time-space complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers