Proofs of proximity for context-free languages and read-once branching programs

DOI10.1016/j.ic.2018.02.003zbMath1395.68169WikidataQ113872846 ScholiaQ113872846MaRDI QIDQ1640993

Oded Goldreich, Ron D. Rothblum, Tom Gur

Publication date: 14 June 2018

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2018.02.003

zbMATH Keywords

interactive proofs; property testing; probabilistic proof systems

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

68W20: Randomized algorithms

03F20: Complexity of proofs

Uses Software

• ALGOL 60