On Algebraic Branching Programs of Small Width

Bringmann, Karl; Ikenmeyer, Christian; Zuiddam, Jeroen

doi:10.4230/LIPIcs.CCC.2017.20

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On Algebraic Branching Programs of Small Width

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons202366

Ikenmeyer, Christian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2017/7521/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K., Ikenmeyer, C., & Zuiddam, J. (2017). On Algebraic Branching Programs of Small Width. In R. O'Donnell (Ed.), 32nd Computational Complexity Conference (pp. 1-31). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.CCC.2017.20.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002D-FB78-C

Abstract

There is no abstract available