Image de couverture de livre

Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Zeyu, Wu, Junde
Format:	Preprint
Publié:	2025
Sujets:	Formal Languages and Automata Theory Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Classical and quantum Merlin-Arthur automata
par: Yakaryılmaz, Abuzer
Publié: (2022)

Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error
par: Gezer, M. Utkan, et autres
Publié: (2020)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
par: Chen, Zeyu, et autres
Publié: (2026)

Exact Separation of Words via Trace Geometry
par: Chen, Zeyu, et autres
Publié: (2026)

Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications
par: Moreira, Nelma, et autres
Publié: (2025)

On the complexity of computing Strahler numbers
par: Ganardi, Moses, et autres
Publié: (2025)

Studying homing and synchronizing sequences for Timed Finite State Machines with output delays
par: Vinarskii, Evgenii, et autres
Publié: (2025)

Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
par: Yamakami, Tomoyuki
Publié: (2024)

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$-Partitions
par: Podolskii, Vladimir, et autres
Publié: (2024)

Regular Expressions with Backreferences and Lookaheads Capture NLOG
par: Uezato, Yuya
Publié: (2024)

Maximal Length Cellular Automata : A Survey
par: Adak, Sumit, et autres
Publié: (2024)

Trading Determinism for Noncommutativity in Edmonds' Problem
par: Arvind, V., et autres
Publié: (2024)

Visibly Recursive Automata
par: Dubrulle, Kévin, et autres
Publié: (2026)

Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata
par: Yamakami, Tomoyuki
Publié: (2022)

Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
par: Haneef, Farah
Publié: (2024)

Entropy of pebble automata and space complexity
par: Montoya, J. Andres
Publié: (2026)

Complexity of Unary Exclusive Nondeterministic Finite Automata
par: Kutrib, Martin, et autres
Publié: (2024)

Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
par: Yamakami, Tomoyuki
Publié: (2023)

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
par: Yamakami, Tomoyuki
Publié: (2021)

Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)
par: Manea, Florin, et autres
Publié: (2024)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
par: Yamakami, Tomoyuki
Publié: (2021)

Complexity of Fungal Automaton Prediction
par: Formenti, Enrico, et autres
Publié: (2026)

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
par: Bozga, Marius, et autres
Publié: (2026)

Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits
par: Yamakami, Tomoyuki
Publié: (2024)

Synthesis of Timeline-Based Planning Strategies Avoiding Determinization
par: Acampora, Renato, et autres
Publié: (2024)

Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
par: Goles, Eric, et autres
Publié: (2026)

On the Simulation Cost of Quantum Finite Automata
par: Chen, Zeyu, et autres
Publié: (2026)

Matching walks that are minimal with respect to edge inclusion
par: Marsault, Victor
Publié: (2024)

Computability of Agentic Systems
par: Viriyasuthee, Chatavut
Publié: (2026)

Membership and Conjugacy in Inverse Semigroups
par: Fleischer, Lukas, et autres
Publié: (2025)

Time complexity for deterministic string machines
par: Cataltepe, Ali, et autres
Publié: (2024)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
par: Yamakami, Tomoyuki
Publié: (2024)

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
par: Halftermeyer, Pierre
Publié: (2026)

The Complexity of Nested Reset Counter Systems
par: Balasubramanian, A. R., et autres
Publié: (2026)

Exact Expressive Power of Transformers with Padding
par: Merrill, William, et autres
Publié: (2025)

QIP $ \subseteq $ AM(2QCFA)
par: Yakaryılmaz, Abuzer
Publié: (2025)

Unconditional proofs of quantumness between small-space machines
par: Say, A. C. Cem, et autres
Publié: (2024)

An Invitation to Universality in Physics, Computer Science, and Beyond
par: Gonda, Tomáš, et autres
Publié: (2024)

Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice
par: Yamakami, Tomoyuki
Publié: (2019)

How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory?
par: Yamakami, Tomoyuki
Publié: (2020)