English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions

MPS-Authors
/persons/resource/persons202366

Ikenmeyer,  Christian
Group J. Ouaknine, Max Planck Institute for Software Systems, Max Planck Society;

External Ressource
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Dörfler, J., Ikenmeyer, C., & Panova, G. (2019). On Geometric Complexity Theory: Multiplicity Obstructions Are Stronger Than Occurrence Obstructions. In C. Baier, I. Chaztigiannakis, P. Flocchini, & S. Leonardi (Eds.), 46th International Colloquium on Automata, Languages, and Programming (pp. 1-14). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2019.51.


Cite as: http://hdl.handle.net/21.11116/0000-0005-1D6B-4
Abstract
There is no abstract available