Computation with multiple CTCs of fixed length and width (Q256423): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Quantum computing, postselection, and probabilistic polynomial-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed timelike curves make quantum and classical computing equivalent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computability / 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: Perfect state distinguishability and computational speedups with postselected closed timelike curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown automata with bounded nondeterminism and bounded ambiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4662826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On probabilistic pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism and Boolean operations in pda's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving the Power of Postselection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-error quantum computation with small space bounds / rank
 
Normal rank

Latest revision as of 14:04, 11 July 2024

scientific article
Language Label Description Also known as
English
Computation with multiple CTCs of fixed length and width
scientific article

    Statements

    Computation with multiple CTCs of fixed length and width (English)
    0 references
    0 references
    0 references
    9 March 2016
    0 references
    closed timelike curve (CTC)
    0 references
    CTC-based computation
    0 references
    postselection
    0 references
    polynomial-time probabilistic and quantum algorithms
    0 references
    probabilistic automata
    0 references
    quantum automata
    0 references
    deterministic pushdown automata
    0 references
    limited nondeterminism
    0 references

    Identifiers