Oded Goldreich, Tom Gur, Ron Rothblum. Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), 22:24, 2015. [doi]
@article{GoldreichGR15,
title = {Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs},
author = {Oded Goldreich and Tom Gur and Ron Rothblum},
year = {2015},
url = {http://eccc.hpi-web.de/report/2015/024},
researchr = {https://researchr.org/publication/GoldreichGR15},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {22},
pages = {24},
}