External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Hardness of Function Composition for Semantic Read once Branching Programs

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]

Authors

Jeff Edmonds

This author has not been identified. Look up 'Jeff Edmonds' in Google

Venkatesh Medabalimi

This author has not been identified. Look up 'Venkatesh Medabalimi' in Google

Toniann Pitassi

This author has not been identified. Look up 'Toniann Pitassi' in Google
runs on