Quantum alternation (Q2361668): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computing, postselection, and probabilistic polynomial-time / 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: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability in Two-Clock Timed Automata Is PSPACE-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A context-free language which is not acceptable by a probabilistic automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games against nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-player games of incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with new resources. Essays dedicated to Jozef Gruska on the occasion of his 80th birthday / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2913801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded quantum complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of simulating space-bounded quantum computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer science -- theory and applications. 8th international computer science symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25--29, 2013. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3171611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-error quantum computation with small space bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving the Power of Postselection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Debates with Small Transparent Quantum Verifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\) / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s1995080216060196 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3192680852 / rank
 
Normal rank

Latest revision as of 08:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Quantum alternation
scientific article

    Statements

    Quantum alternation (English)
    0 references
    30 June 2017
    0 references
    alternation
    0 references
    quantum computation
    0 references
    quantum automata
    0 references
    PSPACE
    0 references
    LOGSPACE
    0 references
    polynomial hierarchy
    0 references
    subset-sum problems
    0 references

    Identifiers