Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi. Hardness of Function Composition for Semantic Read once Branching Programs. In Rocco A. Servedio, editor, 33rd Computational Complexity Conference, CCC 2018, June 22-24, 2018, San Diego, CA, USA. Volume 102 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]
@inproceedings{EdmondsMP18,
title = {Hardness of Function Composition for Semantic Read once Branching Programs},
author = {Jeff Edmonds and Venkatesh Medabalimi and Toniann Pitassi},
year = {2018},
doi = {10.4230/LIPIcs.CCC.2018.15},
url = {https://doi.org/10.4230/LIPIcs.CCC.2018.15},
researchr = {https://researchr.org/publication/EdmondsMP18},
cites = {0},
citedby = {0},
booktitle = {33rd Computational Complexity Conference, CCC 2018, June 22-24, 2018, San Diego, CA, USA},
editor = {Rocco A. Servedio},
volume = {102},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-069-9},
}