Constant-space, constant-randomness verifiers with arbitrarily small error (Q2084769): 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 / OpenAlex ID
 
Property / OpenAlex ID: W3037402156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Windable heads and recognizing \textsf{NL} with constant randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proof systems with polynomially bounded strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state verifiers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of quantum finite automata to interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs with quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-oracle interactive protocols with constant space verifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of debate checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Debates with Small Transparent Quantum Verifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state verifiers with constant randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of multi-head finite automata: origins and directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-determinacy in simple computing devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional and computational complexity of finite automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the max word problem and the power of one-way interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-space tradeoff for language recognition / rank
 
Normal rank

Latest revision as of 10:58, 30 July 2024

scientific article
Language Label Description Also known as
English
Constant-space, constant-randomness verifiers with arbitrarily small error
scientific article

    Statements

    Constant-space, constant-randomness verifiers with arbitrarily small error (English)
    0 references
    0 references
    0 references
    13 October 2022
    0 references
    interactive proof systems
    0 references
    multi-head finite automata
    0 references
    probabilistic finite automata
    0 references

    Identifiers