Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.