Classical and Quantum Computations with Restricted Memory (Q6163622): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-98355-4_9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2885088151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds and Hierarchies for Quantum Memoryless Communication Protocols and Quantum Ordered Binary Decision Diagrams with Repeated Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of probabilistic and quantum branching program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very narrow quantum OBDDs and width hierarchies for classical OBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of the hierarchy for \(k\)-OBDDs of small width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Cayley graphs and expanders / 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: Superiority of exact quantum automata for promise problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Analysis of Aggregate Max in Windowed Streaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds for read-\(k\)-times branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of performance measures for online algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Frequent Items Problem in Online Streaming Under Various Performance Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Sets for Nonabelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of maintaining frequent items of a stream / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Las Vegas Automata by Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of nondeterminism and randomness for oblivious branching programs / 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 the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interaction in quantum communication and the complexity of set disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Width hierarchy for \(k\)-OBDD of small width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reordering method and hierarchies for quantum and classical ordered binary decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interaction in Quantum Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quantum and probabilistic communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-time interacting quantum walks and quantum hash schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of the two-particle controlled interacting quantum walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum branching programs and space-bounded nonuniform quantum complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414546 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:05, 1 August 2024

scientific article; zbMATH DE number 7704716
Language Label Description Also known as
English
Classical and Quantum Computations with Restricted Memory
scientific article; zbMATH DE number 7704716

    Statements

    Classical and Quantum Computations with Restricted Memory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2023
    0 references
    complexity
    0 references
    quantum computation
    0 references
    branching programs
    0 references
    OBDDs
    0 references
    quantum hash function
    0 references
    streaming algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references