Metraipolis › archive › dc_d69e4cfebe3f

Constant-Coin Complete-Information Debates for $\mathsf{P}$ with Arbitrarily Small Strong Error — arXiv:2609.24272

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.24272
License (as archived)
CC0-1.0
Archived
2026-10-09T22:41:21.764Z
SHA-256 of the archived text
304fa4b931bd642025feab00fb3d77d01d9b15987851b22d54e8cb49743642c9
Stable URL of this page
https://metraipolis.com/documento/dc_d69e4cfebe3f

How to cite

Constant-Coin Complete-Information Debates for $\mathsf{P}$ with Arbitrarily Small Strong Error — arXiv:2609.24272 — arXiv (en), https://arxiv.org/abs/2609.24272 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d69e4cfebe3f (Metraipolis archive dc_d69e4cfebe3f, sha256 304fa4b931bd642025feab00fb3d77d01d9b15987851b22d54e8cb49743642c9)
BibTeX
@misc{dcd69e4cfebe3f,
  title = {Constant-Coin Complete-Information Debates for $mathsfP$ with Arbitrarily Small Strong Error — arXiv:2609.24272},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.24272},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d69e4cfebe3f; sha256 304fa4b931bd642025feab00fb3d77d01d9b15987851b22d54e8cb49743642c9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24272. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study complete-information debate systems in which a probabilistic finite-state verifier reads the alternating messages of a prover and a refuter. Demirci, Say, and Yakaryılmaz showed that every language in $\mathsf{P}$ has such debates checkable with a constant number of random bits and arbitrarily small weak error. Their strong-error construction, which also counts nontermination as failure, did not permit arbitrary error reduction. We close this gap: for every $L\in\mathsf{P}$ and every $\varepsilon>0$, there is a constant-space verifier using a constant number of private coin tosses that has perfect completeness and strong error at most $\varepsilon$. The verifier simulates a polynomial-time alternating multihead finite automaton, privately spot-checking one of its input heads. The key observation is that, on a nonmember, the refuter may concede any round in which the prover first misreports a head reading. This ensures termination against every prover when the refuter follows the specified strategy, and permits strong-error reduction by repetition.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in cs.CC).
Categorie arXiv: Computational Complexity (cs.CC) ; Formal Languages and Automata Theory (cs.FL).
Pagina del lavoro: https://arxiv.org/abs/2609.24272 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T22:24:34.152Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).